Taming paraconsistent (and other) logics: an algorithmic approach
DOI10.1145/2661636zbMATH Open1354.03082OpenAlexW2131087632WikidataQ130887642 ScholiaQ130887642MaRDI QIDQ2946751FDOQ2946751
Authors: Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky 
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
Recommendations
- Automated support for the investigation of paraconsistent and other logics
- Tools for the investigation of substructural and paraconsistent logics
- Analytic calculi for basic logics of formal inconsistency
- On the construction of analytic sequent calculi for sub-classical logics
- scientific article; zbMATH DE number 4164174
Paraconsistent logics (03B53) Proof theory in general (including proof-theoretic semantics) (03F03) Logic programming (68N17)
Cites Work
- The Isabelle Framework
- Isabelle/HOL. A proof assistant for higher-order logic
- On the theory of inconsistent formal systems
- Modular construction of cut-free sequent calculi for paraconsistent logics
- Automated support for the investigation of paraconsistent and other logics
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Title not available (Why is that?)
- Logics of formal inconsistency
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Non-deterministic Multiple-valued Structures
- Bounded proofs and step frames
- Algorithmic correspondence and canonicity for distributive modal logic
- Logical non-determinism as a tool for logical modularity: an introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Title not available (Why is that?)
- SAT-based decision procedure for analytic pure sequent calculi
- Cut elimination for shallow modal logics
- Proof systems combining classical and paraconsistent negations
- A hierarchy of weak double negations
- Finite-valued semantics for canonical labelled calculi
- Title not available (Why is that?)
Cited In (11)
- Computational properties of partial non-deterministic matrices and their logics
- Title not available (Why is that?)
- Table-analytical axiomatizations of expansions of logic Par
- Automated support for the investigation of paraconsistent and other logics
- Some recent applications of paraconsistent systems to AI
- Title not available (Why is that?)
- Paraconsistent intelligent systems of computer logics
- Tools for the investigation of substructural and paraconsistent logics
- Title not available (Why is that?)
- On Axioms and Rexpansions
- An unexpected Boolean connective
Uses Software
This page was built for publication: Taming paraconsistent (and other) logics: an algorithmic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946751)
