DECIDABLE MODELS OF ω-STABLE THEORIES

DOI10.1017/jsl.2013.2zbMath1337.03048OpenAlexW2156140706MaRDI QIDQ2921028

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

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)

Related Items (2)

There is no classification of the decidably presentable structures ⋮ Algebraic structures computable without delay

Cites Work

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

This page was built for publication: DECIDABLE MODELS OF ω-STABLE THEORIES