The paper subsumes and extends in a radical way a line of research aimed at automation of reasoning with inconsistent information using paraconsistent logics. We provide a new method for uniform, modular construction of analytic calculi for all major logics in the crucial class of paraconsistent logics known as C-systems. The method is based on semantic characterization of those logics via non-deterministic matrices (Nmatrices), and - unlike that developed previously - is also applicable to C-systems which can only be characterized by infinite Nmatrices. What is more, we show that the results obtained in this paper for infinite semantics imply our earlier results for finite semantics.
Bibliographical noteFunding Information:
The first author is supported by The Israel Science Foundation under Grant Agreement No. 280-10 .
© 2014 Elsevier Inc. All rights reserved.
- Analytic proof systems
- Gentzen-style calculi
- Inconsistent information
- Many-valued logics
- Non-deterministic logical matrices
- Paraconsistent logics
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence