Modular construction of cut-free sequent calculi for paraconsistent logics

DOI10.1109/LICS.2012.20MaRDI QIDQ2986784zbMATH OpenOpenAlexFDO

Authors Arnon Avron, Beata Konikowska, Anna Zamansky

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2012.20

zbMATH Keywords

multivalued logicnondeterministic semanticsparaconsistent logicproof theory

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Paraconsistent logics (03B53) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Cut-free sequent calculi for C-systems with generalized finite-valued semantics
• Analytic calculi for basic logics of formal inconsistency
• Automated support for the investigation of paraconsistent and other logics
• scientific article; zbMATH DE number 4091467
• Automatic reasoning in paraconsistent logic

Cited in

(19)

• Modular semantics for theories: an approach to paraconsistent reasoning
• Negative modalities, consistency and determinedness
• Taming paraconsistent (and other) logics: an algorithmic approach
• Automating and computing paraconsistent reasoning: contraction-free, resolution and type systems
• Automated support for the investigation of paraconsistent and other logics
• scientific article; zbMATH DE number 4091467 (Why is no real title available?)
• scientific article; zbMATH DE number 16516 (Why is no real title available?)
• scientific article; zbMATH DE number 2019867 (Why is no real title available?)
• scientific article; zbMATH DE number 6863649 (Why is no real title available?)
• Analytic calculi for basic logics of formal inconsistency
• A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
• On Axioms and Rexpansions
• Efficient reasoning with inconsistent information using C-systems
• Cut-free sequent calculi for C-systems with generalized finite-valued semantics
• REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
• A modal axiomatization of \(\mathbf{BK}\)
• Some more theorems on structural entailment relations and non-deterministic semantics
• A constructive proof of the Craig's interpolation theorem for \textbf{QCiore}
• Proof-theoretic aspects of paraconsistency with strong consistency operator

This page was built for publication: Modular construction of cut-free sequent calculi for paraconsistent logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986784)