Complexity estimates for theories of some classes of prime models

DOI10.70474/WY2XAJ39MaRDI QIDQ6862141zbMATH OpenFDO

Authors Mikhaĭl G. Peretyat'kin

Publication date 9 February 2026

Published in Kazakh Mathematical Journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.70474/WY2XAJ39

zbMATH Keywords

algorithmic complexity estimatesmodel with algebraic elementsmodel with first-order definable elementsprime modelsemantic class of models

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Cites work

• A remark concerning decidability of complete theories
• An application of games to the completeness problem for formalized theories
• Constructive models of complete solvable theories
• Expressive power of finitely axiomatizable theories. III: The main construction
• scientific article; zbMATH DE number 3829873 (Why is no real title available?)
• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 1081433 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3304085 (Why is no real title available?)
• scientific article; zbMATH DE number 3183991 (Why is no real title available?)
• Introduction to model theory and to the metamathematics of algebra
• On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models
• Recursively presentable prime models
• The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
• The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
• The Tarski-Lindenbaum algebra of the class of prime models with infinite algorithmic dimensions having omega-stable theories
• The Tarski-Lindenbaum algebra of the class of strongly constructivizable models with -stable theories
• Turing machine computations in finitely axiomatizable theories
• Universal Boolean algebras with applications to semantic classes of models

This page was built for publication: Complexity estimates for theories of some classes of prime models

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