scientific article; zbMATH DE number 2042613
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Abstract deductive systems (03B22) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)
The problem of adapting to many-valued logics the usual methods of automated reasoning (like Gentzen-type systems, tableaux, and resolution) has attracted a lot of attention in recent years. This paper concentrates on proof systems that use the same syntactic structures as the classical ones, with particular emphasis on Gentzen-type systems. This approach has two advantages. First, the implementation of these proof systems can be based on existing systems, because no new data structure is used. Second, two sided sequents (like those used in classical logic) can directly represent the consequence relation of any given logic. A decent Gentzen-type system for a logic should allow for direct proofs, which means that it should admit some useful forms of cut-elimination and the subformula property. In this marvellous survey, Arnon Avron explains the main difficulty in developing classical Gentzen-type systems with these properties for many-valued logics, and discusses the possible methods of overcoming this difficulty. These methods are illustrated with numerous examples, including practically all 3-valued and 4-valued logics, as well as Gödel finite-valued logics and several well-known infinite-valued logics which can be taken to be semi-finite. It is demonstrated that there exists a strong connection between semantic completeness (usually a strong one) and (a strong version of) the admissibility of the cut rule. The various proofs that are presented (most of which are new) establish therefore both strong completeness and strong cut-elimination at the same time. For the entire collection see [Zbl 1015.00007].
- Rough sets and 3-valued logics
- Gentzen-type systems, resolution and tableaux
- The \textsc{Fmla-Fmla} axiomatizations of the exactly true and non-falsity logics and some of their cousins
- Two-sided sequent calculi for \textit{FDE}-like four-valued logics
- Notes on models of (partial) Kripke-Feferman truth
- Kripke Semantics for Basic Sequent Systems
- scientific article; zbMATH DE number 3878900 (Why is no real title available?)
- scientific article; zbMATH DE number 695097 (Why is no real title available?)
- Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
- Strict-choice validities: A note on a familiar pluralism
- Exactly true and non-falsity logics meeting infectious ones
- scientific article; zbMATH DE number 7455717 (Why is no real title available?)
- Three-valued logic for reasoning about covering-based rough sets
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- Categoricity problem for LP and K3
- On retaining classical truths and classical deducibility in many-valued and fuzzy logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450442)