Towards recursive model theory

MaRDI QIDQ4381423zbMATH OpenFDO

Authors Alexei P. Stolboushkin

Publication date 13 August 1998

zbMATH Keywords

compactness theoremcompleteness theoreminterpolationrecursive models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Review text

The author argues that recursive model theory is worthy to be studied as a subject relevant to computer science and shows that this area differs from ordinary model theory very much. As examples, he considers the Completeness Theorem, the Compactness Theorem, the Beth Theorem, the Craig Interpolation Theorem and the Lyndon Lemma, and he shows all these properties to fail to be true for recursive models. For the entire collection see [Zbl 0884.00035].

Recommendations

• scientific article; zbMATH DE number 1390025
• Sufficiency conditions for theories with recursive models
• Towards a theory of recursive structures

Cited in

(11)

• Sufficiency conditions for theories with recursive models
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Metafinite model theory
• Effective choice of constructivizations and recursive consistency of problems on constructive models
• Analysis of Recursive Probabilistic Models
• scientific article; zbMATH DE number 1302880 (Why is no real title available?)
• scientific article; zbMATH DE number 1390025 (Why is no real title available?)
• scientific article; zbMATH DE number 6785324 (Why is no real title available?)
• Effective model theory vs. recursive model theory
• A non-standard study of the theory of relative recursivity
• Metalinear recursive schemas on marked trees

This page was built for publication: Towards recursive model theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381423)