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.
| Original language | English |
|---|---|
| Pages (from-to) | 517-540 |
| Number of pages | 24 |
| Journal | Journal of Logic and Computation |
| Volume | 23 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2013 |
| Externally published | Yes |
Bibliographical note
Funding Information:The first author is supported by The Israel Science Foundation under grant agreement no. 280-10. The third author is supported by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 252314.
Keywords
- automated deduction
- many-valued logic
- non-deterministic semantics
- paraconsistent logic
- proof systems
- sequent calculi
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Arts and Humanities (miscellaneous)
- Hardware and Architecture
- Logic