Ciabattoni, A., Lahav, O., Spendier, L. K., & Zamansky, A. (2014). Taming Paraconsistent (and Other) Logics : An Algorithmic Approach. ACM Transactions on Computational Logic, 16(1), 1–23. https://doi.org/10.1145/2661636
Theoretical Computer Science; General Computer Science; Computational Mathematics; Logic
en
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.
