Belnap's Four-Valued Logic and De Morgan Lattices
From MaRDI portal
Publication:4340541
DOI10.1093/jigpal/5.3.1-ezbMath0871.03012OpenAlexW2038185098MaRDI QIDQ4340541
Publication date: 3 September 1997
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/5.3.1-e
Logical aspects of lattices and related structures (03G10) Many-valued logic (03B50) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30)
Related Items
THE LATTICE OF SUPER-BELNAP LOGICS ⋮ Kleene algebras and logic: Boolean and rough set representations, 3-valued, rough set and perp semantics ⋮ De Morgan clones and four-valued logics ⋮ Polarity semantics for negation as a modal operator ⋮ Neutrosophic logics: Prospects and problems ⋮ Reductio ad contradictionem: an algebraic perspective ⋮ Natural dualities through product representations: bilattices and beyond ⋮ A Gentzen calculus for nothing but the truth ⋮ Representation of De Morgan and (semi-)Kleene lattices ⋮ Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning ⋮ Paraconsistent metatheory: new proofs with old tools ⋮ On residuation in paraorthomodular lattices ⋮ Admissibility in De Morgan algebras ⋮ Selfextensional logics with a conjunction ⋮ Bilattices with implications ⋮ Categorical abstract algebraic logic: referential algebraic semantics ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ An infinity of super-Belnap logics ⋮ The strong version of a sentential logic ⋮ Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic ⋮ Consequence and Degrees of Truth in Many-Valued Logic ⋮ 40 years of FDE: an introductory overview ⋮ An algebraic view of super-Belnap logics ⋮ Cut elimination, identity elimination, and interpolation in super-Belnap logics ⋮ First-degree entailment and its relatives ⋮ The B4-valued propositional Belnap-Dunn logic1 ⋮ The nature of entailment: an informational approach ⋮ A deterministic weakening of Belnap-Dunn logic ⋮ Abstract algebraic logic. An introductory chapter ⋮ Relational semantics for normal topological quasi-Boolean logic ⋮ Unnamed Item ⋮ PROOF SYSTEMS FOR EXACT ENTAILMENT ⋮ A capacity-based semantics for inconsistency-tolerant inferences ⋮ Nothing but the truth ⋮ On the closure properties of the class of full G-models of a deductive system ⋮ Four-Valued Logics BD and DM4: Expansions ⋮ Notes on models of (partial) Kripke-Feferman truth ⋮ The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\) ⋮ Varieties of interlaced bilattices ⋮ Representation of interlaced trilattices ⋮ FDE as a Base for Constructive Logic ⋮ First-Degree Entailment and Structural Reasoning ⋮ Priest on Negation ⋮ Four-valued logics of truth, nonfalsity, exact truth, and material equivalence ⋮ Probabilities with gaps and gluts ⋮ Belnap-Dunn modal logic with value operators ⋮ Proof theory of paraconsistent quantum logic ⋮ On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis ⋮ A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information ⋮ Beyond Rasiowa's algebraic approach to non-classical logics ⋮ Non-distributive relatives of ETL and NFL ⋮ Natural Deduction for Four-Valued both Regular and Monotonic Logics ⋮ The \textsc{Fmla-Fmla} axiomatizations of the exactly true and non-falsity logics and some of their cousins ⋮ Characterizing finite-valuedness ⋮ Hilbert-style axiomatization of first-degree entailment and a family of its extensions ⋮ Taking degrees of truth seriously ⋮ Countably many weakenings of Belnap-Dunn logic ⋮ Paraconsistent Modal Logics ⋮ Containment logics: algebraic completeness and axiomatization ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ On prevarieties of logic ⋮ Bilattice logic properly displayed ⋮ Distributive bilattices from the perspective of natural duality theory. ⋮ An algebraic study of exactness in partial contexts ⋮ Some useful 16-valued logics: How a computer network should think
