No label defined (Q4450442)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2042613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2042613 |
Statements
15 February 2004
0 references
sequent calculus
0 references
Gentzen-type system
0 references
many-valued logic
0 references
survey
0 references
0.7993717193603516
0 references
0.7793990969657898
0 references
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].
0 references