Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence

DOI10.12775/LLP.2016.029zbMath1477.03074MaRDI QIDQ4683207

No author found.

Publication date: 20 September 2018

Published in: Logic and Logical Philosophy (Search for Journal in Brave)

zbMATH Keywords

Bochvar's logic \(\mathbf{B}_3\)isomorphs, extended formulaslattice of paralogicsparacomplete logics \(\mathbf{I}^1\) and \(\mathbf I^1_2\)paraconsistent logics \(\mathbf{P}^1\) and \(\mathbf{P}^1_2\)paranormal logic \(\mathbf{TK}^1\)strong and weak modus ponens

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53)

Related Items (16)

Correspondence analysis for some fragments of classical propositional logic ⋮ Paracomplete logics dual to the genuine paraconsistent logics: the three-valued case ⋮ Generalized correspondence analysis for three-valued logics ⋮ A lattice of the paracomplete calculi ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ On solvability of systems of partial fuzzy relational equations ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3 ⋮ Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation ⋮ Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis ⋮ Missing values and dragonfly operations in fuzzy relational compositions ⋮ Containment logics: algebraic completeness and axiomatization ⋮ Deduction normalization theorem for Sette's logic and its modifications ⋮ Functional Completeness in CPL via Correspondence Analysis ⋮ The Method of Socratic Proofs Meets Correspondence Analysis ⋮ A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics

Cites Work

• A map of dependencies among three-valued logics
• A criterion of functional completeness for \({\mathfrak B}^3\)
• Algebraic study of Sette's maximal paraconsistent logic
• The classification of propositional calculi
• Anti-intuitionism and paraconsistency
• Paraconsistent logics and translations
• Maximal weakly-intuitionistic logics
• On finite-valued propositional logical calculi
• Paraconsistency and Sette’s calculus P1
• On The Imaginary Logic of N. A. VASILIEV
• A propositional calculus for inconsistent deductive systems
• Jaśkowski's criterion and three-valued paraconsistent logics
• On the logics related to A. Arruda’s system V1
• Literal-paraconsistent and literal-paracomplete matrices
• Natural 3-valued logics—characterization and proof theory
• On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus
• Nonsense logics and their algebraic properties
• A Lattice of Implicative Extensions of Regular Kleene's Logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence