COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX

DOI10.1017/S1755020312000196zbMath1270.03045OpenAlexW2096368704MaRDI QIDQ4899968

Allard M. Tamminga, Barteld P. Kooi

Publication date: 10 January 2013

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1755020312000196

zbMATH Keywords

natural deductionsemanticsmany-valued logicscorrespondence theory

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (23)

Correspondence analysis for some fragments of classical propositional logic ⋮ Generalized correspondence analysis for three-valued logics ⋮ The natural deduction systems for the three-valued nonsense logics Z and E ⋮ Natural deduction for Post's logics and their duals ⋮ Natural deduction system for three-valued Heyting's logic ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ Natural deduction for Fitting's four-valued generalizations of Kleene's logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-transitive correspondence analysis ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ Two-sided sequent calculi for \textit{FDE}-like four-valued logics ⋮ 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 ⋮ Natural deduction for three-valued regular logics ⋮ Natural Deduction for Four-Valued both Regular and Monotonic Logics ⋮ Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis ⋮ 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 ⋮ Normalisation for Some Quite Interesting Many-Valued Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of philosophical logic. Vol. 1.

This page was built for publication: COMPLETENESS VIA CORRESPONDENCE FOR EXTENSIONS OF THE LOGIC OF PARADOX