Classical negation and expansions of Belnap-Dunn logic (Q495842)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Classical negation and expansions of Belnap-Dunn logic
scientific article

    Statements

    Classical negation and expansions of Belnap-Dunn logic (English)
    0 references
    0 references
    0 references
    15 September 2015
    0 references
    The paper considers the four-valued Belnap-Dunn Logic \(\mathbf{BD}\). The designated values are \(\mathbf{t}\) (``truth only''), \(\mathbf{b}\) (``both truth and falsity''), \(\mathbf{f}\) (``falsity only'') and \(\mathbf{n}\) (``neither truth nor falsity''). The authors start with an extensive semantic characterization of classical negation applicable to non-classical logics. This search results in a final consideration of four candidates for a classical negation in a four-valued setting: \( \neg:\{t,b,n,f\} \mapsto \{f,n,b,t\}\) ; \(\neg^1:\{t,b,n,f\} \mapsto \{f,n,t,t\}\); \(\neg^2:\{t,b,n,f\} \mapsto \{f,f,b,t\}\);\(\neg^e:\{t,b,n,f\} \mapsto \{f,f,t,t\}\), From the property that a sentence should be semanticaly equivalent with its double negation, \(\neg\) remains the unique candidate to extend \(\mathbf{BD}\) to \(\mathbf{BD}_+\). The language of \(\mathbf{BD}_+\) includes besides \(\{\sim,\wedge,\vee\}\), the symbols \(\{ \rightarrow, \neg\}\). An Hilbert style axiom system is presented for \(\mathbf{BD}_+\). The system consists of 16 axioms plus the modus ponens rule. It is shown that \(\mathbf{BD}_+\) is sound and complete with respect to the cosidered semantics. Finally, it is shown that \(\mathbf{BD}_+\) is essentially equivalent to \textit{J.-Y. Béziau}'s four-valued modal logic [Log. J. IGPL 7, No. 2, 145--151 (1999; Zbl 0924.03012)] and \textit{D. Zaitsev}'s paraconsistent logic [Generalized relevant logic and models of reasoning. (Russian) Moscow: Lomonosov Moscow State University (PhD Thesis) (2010)].
    0 references
    classical negation
    0 references
    many-valued logic
    0 references
    maximality
    0 references
    Belnap-Dunn logic
    0 references
    first-degree entailment
    0 references
    paracompleteness
    0 references
    paraconsistency
    0 references

    Identifiers