Taming paraconsistent (and other) logics: An algorithmic approach

Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky

Research output: Contribution to journalArticlepeer-review


We develop a fully algorithmic approach to "taming" logics expressed Hilbert style, that is, reformulating them in terms of analytic sequent calculi and useful semantics. Our approach applies to Hilbert calculi extending the positive fragment of propositional classical logic with axioms of a certain general form that contain new unary connectives. Our work encompasses various results already obtained for specific logics. It can be applied to new logics, as well as to known logics for which an analytic calculus or a useful semantics has so far not been available. A Prolog implementation of the method is described.

Original languageEnglish
Article number5
JournalACM Transactions on Computational Logic
Issue number1
StatePublished - 29 Dec 2014

Bibliographical note

Publisher Copyright:
© 2014 ACM.


  • Nonclassical logics
  • Nondeterministic matrices
  • Paraconsistent logics
  • Proof theory
  • Sequent calculus

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Logic
  • Computational Mathematics


Dive into the research topics of 'Taming paraconsistent (and other) logics: An algorithmic approach'. Together they form a unique fingerprint.

Cite this