A Lattice of Implicative Extensions of Regular Kleene's Logics

DOI10.4467/20842589RM.12.008.0689zbMath1308.03042OpenAlexW1559874856MaRDI QIDQ5412177

Natal'Ya Evgen'Evna Tomova

Publication date: 25 April 2014

Full work available at URL: https://dblp.uni-trier.de/db/journals/rml/rml47.html#Tomova12

zbMATH Keywords

Kleene logicthree-valued logicsextensions of regular logicslattice of three-valued logics

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (19)

Correspondence analysis for some fragments of classical propositional logic ⋮ Generalized correspondence analysis for three-valued logics ⋮ Belnap-Dunn Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer’s Logic B ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ The logic determined by Smiley’s matrix for Anderson and Belnap’s first-degree entailment logic ⋮ A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes ⋮ On the three-valued expansions of Kleene's logic ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE ⋮ The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3 ⋮ Variations on the Collapsing Lemma ⋮ A class of implicative expansions of Kleene's strong logic, a subclass of which is shown functionally complete via the precompleteness of Ł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 ⋮ Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values ⋮ Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence ⋮ Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis ⋮ Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix II. Only one designated value ⋮ Functional Completeness in CPL via Correspondence Analysis ⋮ The Method of Socratic Proofs Meets Correspondence Analysis

This page was built for publication: A Lattice of Implicative Extensions of Regular Kleene's Logics