Partial and paraconsistent three-valued logics

DOI10.12775/LLP.2016.003zbMath1402.03031MaRDI QIDQ2987760

Vincent Degauquier

Publication date: 18 May 2017

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

zbMATH Keywords

sequent calculusfour-valued logicthree-valued logicpartial logicfunctional completenessparaconsistent logiccut redundancyproof-search procedure

Mathematics Subject Classification ID

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

Related Items (3)

Correspondence analysis and automated proof-searching for first degree entailment ⋮ Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation ⋮ Neutral free logic: motivation, proof theory and models

Cites Work

• On partial and paraconsistent logics
• Normal forms and functional completeness for four-valued languages
• Labeled calculi and finite-valued logics
• Anti-intuitionism and paraconsistency
• Intuitive semantics for first-degree entailments and `coupled trees'
• Partiality and its dual
• Maximal weakly-intuitionistic logics
• Bilattices and the semantics of logic programming
• On the expressive power of three-valued and four-valued languages
• Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness
• 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: Partial and paraconsistent three-valued logics