Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics

DOI10.1109/LICS.2012.20zbMath1364.03043OpenAlexW2078306994MaRDI QIDQ2986784

Anna Zamansky, Beata Konikowska, Arnon Avron

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

proof theorymultivalued logicparaconsistent logicnondeterministic semantics

Mathematics Subject Classification ID

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

Related Items (5)

Negative modalities, consistency and determinedness ⋮ Taming Paraconsistent (and Other) Logics ⋮ REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS ⋮ Efficient reasoning with inconsistent information using C-systems ⋮ On Axioms and Rexpansions

This page was built for publication: Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics