On the computability-theoretic complexity of trivial, strongly minimal models

DOI10.1090/S0002-9939-07-08865-XzbMath1124.03016MaRDI QIDQ5308141

Steffen Lempp, Bakhadyr Khoussainov, Michael Chris Laskowski, D. Reed Solomon

Publication date: 27 September 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

axiomatizabilitycomputable modelstrongly minimaluncountably categoricaltrivial geometry

Mathematics Subject Classification ID

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

Related Items

On two problems of Turing complexity for strongly minimal theories ⋮ A computable ℵ₀-categorical structure whose theory computes true arithmetic ⋮ Building models of strongly minimal theories ⋮ Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 ⋮ The elementary diagram of a trivial, weakly minimal structure is near model complete ⋮ IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

Cites Work

• Unnamed Item
• A new spectrum of recursive models
• Model theory.
• Computable models of theories with few models
• Non Σ_n axiomatizable almost strongly minimal theories
• Recursively presentable prime models
• Constructive models of uncountably categorical theories
• Trivial, strongly minimal theories are model complete after naming constants
• Complexity of Categorical Theories with Computable Models
• Categoricity in Power
• On strongly minimal sets