Automated Support for the Investigation of Paraconsistent and Other Logics

DOI10.1007/978-3-642-35722-0_9zbMath1432.68546OpenAlexW102389334MaRDI QIDQ3455840

Agata Ciabattoni, Lara Spendier, Ori Lahav, Anna Zamansky

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_9

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68V99) Other nonclassical logic (03B60) Paraconsistent logics (03B53)

Related Items (8)

Negative modalities, consistency and determinedness ⋮ Hypersequent rules with restricted contexts for propositional modal logics ⋮ Tools for the Investigation of Substructural and Paraconsistent Logics ⋮ Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics ⋮ Taming Paraconsistent (and Other) Logics ⋮ Quasi-canonical systems and their semantics ⋮ Efficient reasoning with inconsistent information using C-systems ⋮ Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi

Cites Work

• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• On the theory of inconsistent formal systems

This page was built for publication: Automated Support for the Investigation of Paraconsistent and Other Logics