Autostability of prime models under strong constructivizations

DOI10.1007/s10469-009-9072-yzbMath1241.03043OpenAlexW2163824467MaRDI QIDQ431714

Sergei S. Goncharov

Publication date: 29 June 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-009-9072-y

zbMATH Keywords

autostabilityprime modelEhrenfeucht theorystrong constructivization

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)

Related Items

Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations, On decidable categoricity and almost prime models, Degrees of autostability relative to strong constructivizations, The degree of decidable categoricity of a model with infinite solutions for complete formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
• Decidability and the number of countable models
• Strong constructivizability of homogeneous models
• Strong and weak constructivization and computable families
• Decidable models
• Persistently Finite Theories with Hyperarithmetic Models
• Persistently Finite, Persistently Arithmetic Theories
• Effective procedures in field theory
• Complexity of Ehrenfeucht models
• Spectra of computable models for Ehrenfeucht theories
• Theories with recursive models
• Foundations of recursive model theory
• Oб алгебрах формул счётно категоричных теорий
• A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
• Nonarithmetical ℵ₀-categorical theories with recursive models