Cut-free sequent calculi for C-systems with generalized finite-valued semantics
Authors:
- Beata KonikowskaBKBeata Konikowska
- Anna ZamanskyAZAnna Zamansky
- 9 October 2012
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 23 (3) , 517-540
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Proof theory and mathematical meaning of paraconsistent C-systemsJournal of Applied Logic, 2011
- Towards an Efficient Prover for the C1 Paraconsistent LogicElectronic Notes in Theoretical Computer Science, 2009
- Possible-translations semantics for some weak classically-based paraconsistent logicsJournal of Applied Non-Classical Logics, 2008
- Non-deterministic semantics for logics with a consistency operatorInternational Journal of Approximate Reasoning, 2007
- A Non-deterministic View on Non-classical NegationsStudia Logica, 2005
- Non-deterministic Multiple-valued StructuresJournal of Logic and Computation, 2005
- Aspects of Paraconsistent LogicLogic Journal of the IGPL, 1995
- Paraconsistent logics as a formalism for reasoning about inconsistent knowledge basesArtificial Intelligence in Medicine, 1989
- On the theory of inconsistent formal systems.Notre Dame Journal of Formal Logic, 1974
- Propositional sequence-calculi for inconsistent systems.Notre Dame Journal of Formal Logic, 1968