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

zbMATH Keywords

proof theorynonclassical logicsnondeterministic matricessequent calculusparaconsistent logics

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Proof theory in general (including proof-theoretic semantics) (03F03) Logic programming (68N17)

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

Cites Work

• scientific article; zbMATH DE number 5997431 (Why is no real title available?)
• scientific article; zbMATH DE number 1215493 (Why is no real title available?)
• scientific article; zbMATH DE number 2019859 (Why is no real title available?)
• scientific article; zbMATH DE number 877750 (Why is no real title available?)
• scientific article; zbMATH DE number 5244180 (Why is no real title available?)
• A hierarchy of weak double negations
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Algorithmic correspondence and canonicity for distributive modal logic
• Automated support for the investigation of paraconsistent and other logics
• Bounded proofs and step frames
• Cut elimination for shallow modal logics
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• Cut-free sequent calculi for C-systems with generalized finite-valued semantics
• Finite-valued semantics for canonical labelled calculi
• Isabelle/HOL. A proof assistant for higher-order logic
• Logical non-determinism as a tool for logical modularity: an introduction
• Logics of formal inconsistency
• Modular construction of cut-free sequent calculi for paraconsistent logics
• Non-deterministic Multiple-valued Structures
• On the theory of inconsistent formal systems
• Proof systems combining classical and paraconsistent negations
• SAT-based decision procedure for analytic pure sequent calculi
• The Isabelle Framework

Cited In (11)

• Computational properties of partial non-deterministic matrices and their logics
• Title not available (Why is no real title available?)
• 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 no real title available?)
• Paraconsistent intelligent systems of computer logics
• Tools for the investigation of substructural and paraconsistent logics
• Title not available (Why is no real title available?)
• On Axioms and Rexpansions
• An unexpected Boolean connective

Uses Software

• Isabelle
• Isabelle/HOL
• MUltlog

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)