scientific article; zbMATH DE number 1303453
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].
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 Q4250064)