Taming Paraconsistent (and Other) Logics
From MaRDI portal
Publication:2946751
DOI10.1145/2661636zbMath1354.03082OpenAlexW2131087632MaRDI QIDQ2946751
Agata Ciabattoni, Anna Zamansky, Lara Spendier, Ori Lahav
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2661636
Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03) Paraconsistent logics (03B53)
Related Items (4)
Computational properties of partial non-deterministic matrices and their logics ⋮ An unexpected Boolean connective ⋮ Tools for the Investigation of Substructural and Paraconsistent Logics ⋮ On Axioms and Rexpansions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Algorithmic correspondence and canonicity for distributive modal logic
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Proof systems combining classical and paraconsistent negations
- Isabelle/HOL. A proof assistant for higher-order logic
- A hierarchy of weak double negations
- Finite-valued semantics for canonical labelled calculi
- On the theory of inconsistent formal systems
- Bounded Proofs and Step Frames
- Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics
- Cut Elimination for Shallow Modal Logics
- Non-deterministic Multiple-valued Structures
- SAT-Based Decision Procedure for Analytic Pure Sequent Calculi
- Automated Support for the Investigation of Paraconsistent and Other Logics
- The Isabelle Framework
- Logics of Formal Inconsistency
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
This page was built for publication: Taming Paraconsistent (and Other) Logics
