No label defined (Q4250064)
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 1303453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303453 |
Statements
17 June 1999
0 references
logics of schemes
0 references
poly-modal logics
0 references
first-order theories
0 references
algorithm for recognizing the admissibility of inference rules
0 references
decidable logics
0 references
finitely axiomatizable first-order theories
0 references
0.7841764092445374
0 references
0.7676927447319031
0 references
0.7561787366867065
0 references
The author gives a complete description of first-order theories which have an algorithm for recognizing the admissibility of inference rules. He shows that almost all first-order theories have no such algorithm. In particular, a description of first-order theories with decidable logics of schemes is given. Examples of decidable and finitely axiomatizable first-order theories with no recursively enumerable logics of schemes are also given. The paper ends touching on the connection between the logics of schemes and poly-modal propositional logics. For the entire collection see [Zbl 0910.00016].
0 references