<div class="csl-bib-body">
<div class="csl-entry">Ciabattoni, A., Lahav, O., Spendier, L. K., & Zamansky, A. (2014). Taming Paraconsistent (and Other) Logics : An Algorithmic Approach. <i>ACM Transactions on Computational Logic</i>, <i>16</i>(1), 1–23. https://doi.org/10.1145/2661636</div>
</div>
-
dc.identifier.issn
1529-3785
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/157752
-
dc.description.abstract
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.
en
dc.language.iso
en
-
dc.publisher
ASSOC COMPUTING MACHINERY
-
dc.relation.ispartof
ACM Transactions on Computational Logic
-
dc.subject
Theoretical Computer Science
en
dc.subject
General Computer Science
en
dc.subject
Computational Mathematics
en
dc.subject
Logic
en
dc.title
Taming Paraconsistent (and Other) Logics : An Algorithmic Approach
