Abstract
A non-Fregean framework aims to provide a formal tool for reasoning about semantic denotations of sentences and their interactions. Extending a logic to its non-Fregean version involves introducing a new connective
≡≡that allows to separate denotations of sentences from their logical values. Intuitively,
≡≡combines two sentences
φφand
ψψinto a true one whenever
φφand
ψψhave the same semantic correlates, describe the same situations, or have the same content or meaning. The paper aims to compare non-Fregean paraconsistent Grzegorczyk’s logics (Logic of Descriptions
LDLD, Logic of Descriptions with Suszko’s Axioms
LDSLDS, Logic of Equimeaning
LDELDE) with non-Fregean versions of certain well-known paraconsistent logics (Jaśkowski’s Discussive Logic
D2D2, Logic of Paradox
LPLP, Logics of Formal Inconsistency
LFI1LFI1and
LFI2LFI2). We prove that Grzegorczyk’s logics are either weaker than or incomparable to non-Fregean extensions of
LPLP,
LFI1LFI1,
LFI2LFI2. Furthermore, we show that non-Fregean extensions of
LPLP,
LFI1LFI1,
LFI2LFI2, and
D2D2are more expressive than their original counterparts. Our results highlight that the non-Fregean connective
≡≡can serve as a tool for expressing various properties of the ontology underlying the logics under consideration.