Towards an Efficient Prover for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Paraconsistent Logic

DOI10.1016/j.entcs.2009.11.007zbMath1291.03020arXiv1202.4144OpenAlexW2066630725MaRDI QIDQ5170293

Celso A. A. Kaestner, Marcelo Finger, Adolfo Neto

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4144

zbMATH Keywords

paraconsistent logicstableaux systemsKE system\(C_{1}\) logicproblem families

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Paraconsistent logics (03B53)

Related Items (1)

Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi

Uses Software

• KEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reasoning method for a paraconsistent logic
• A semantical analysis of the calculi \(C_n\)
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Analytical tableaux for da Costa's hierarchy of paraconsistent logics C_n, 1≤n<ω
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Logics of Formal Inconsistency

This page was built for publication: Towards an Efficient Prover for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Paraconsistent Logic