Decidable models of -stable theories

DOI10.1017/JSL.2013.2zbMATH Open1337.03048OpenAlexW2156140706MaRDI QIDQ2921028FDOQ2921028

Authors: Uri Andrews 

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2013.2

Recommendations

• Expansions of models of ω-stable theories
• On decidable and computable models of theories
• scientific article; zbMATH DE number 1533641
• Decidable Kripke models of intuitionistic theories
• scientific article; zbMATH DE number 1534487
• Decidable models of small theories
• Decompositions of saturated models of stable theories
• THE STRUCTURE OF MODELS AND A DECIDABILITY CRITERION FOR COMPLETE THEORIES OF FINITE-DIMENSIONAL ALGEBRAS
• Decidability and the number of countable models
• scientific article

zbMATH Keywords

decidable modelsstrongly constructivizable models\(\omega\)-stable

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Cites Work

• A proof of Vaught's conjecture for \(\omega\)-stable theories
• Decidability and the number of countable models
• Vaught's conjecture for superstable theories of finite rank

Cited In (8)

• Constructing \(\omega\)-stable structures: Model completeness.
• Title not available (Why is that?)
• Decidability and the number of countable models
• On limit models over types in the class of \(\omega\)-stable theories
• There is no classification of the decidably presentable structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic structures computable without delay

This page was built for publication: Decidable models of \(\omega\)-stable theories

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