Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics
From MaRDI portal
Publication:2986784
DOI10.1109/LICS.2012.20zbMATH Open1364.03043OpenAlexW2078306994MaRDI QIDQ2986784FDOQ2986784
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
Paraconsistent logics (03B53) Cut-elimination and normal-form theorems (03F05) Mechanization of proofs and logical operations (03B35)
Cited In (9)
- REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
- Negative modalities, consistency and determinedness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Taming Paraconsistent (and Other) Logics
- Modular semantics for theories: an approach to paraconsistent reasoning
- 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
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)
