Cut-free sequent calculi for C-systems with generalized finite-valued semantics

Arnon Avron, Beata Konikowska, Anna Zamansky

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)517-540
Number of pages24
JournalJournal of Logic and Computation
Volume23
Issue number3
DOIs
StatePublished - Jun 2013

Keywords

  • automated deduction
  • many-valued logic
  • non-deterministic semantics
  • paraconsistent logic
  • proof systems
  • sequent calculi

Fingerprint

Dive into the research topics of 'Cut-free sequent calculi for C-systems with generalized finite-valued semantics'. Together they form a unique fingerprint.

Cite this