Journal of Logic and Computation · 2012 · 35 citations · 16 references
HumanitiesComputer ScienceMathematicsFormal MethodsLogicTheory Of ComputationAutomated ReasoningDeductive ReasoningDeductive SystemsModel TheoryNon-classical LogicParaconsistent LogicParaconsistent Model TheoryParaconsistent Semantics
In the paper Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics by A. Avron, J. Ben-Naim, and B. Konikowska. (Logica Universalis, 1:41–69, 2006), a general method was developed for generating cut-free ordinary sequent calculi for logics that can be characterized by finite-valued semantics based on non-deterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applying that method to a certain crucial family of thousands of paraconsistent logics, all belonging to the class of C-systems. For that family, the method produces in a modular way uniform Gentzen-type rules corresponding to a variety of axioms considered in the literature.
16
On the theory of inconsistent formal systems.
Newton C. A. da Costa · Notre Dame Journal of Formal Logic · 1974 · 739 citations · Full text
Non-deterministic Multiple-valued Structures
Arnon Avron, Iddo Lev · Journal of Logic and Computation · 2005 · 182 citations
Formal inconsistency and evolutionary databases
Walter Carnielli, João Marcos, Sandra de Amo · Logic and Logical Philosophy · 2004 · 143 citations · Full text
Aspects of Paraconsistent Logic
Newton C. A. da Costa, Jean-Yves Béziau, Otávio Bueno · Logic Journal of IGPL · 1995 · 64 citations