Trivial, strongly minimal theories are model complete after naming constants
From MaRDI portal
Publication:4425430
DOI10.1090/S0002-9939-03-06951-XzbMath1035.03013OpenAlexW2086643971MaRDI QIDQ4425430
Steffen Lempp, Michael Chris Laskowski, Valentina S. Harizanov, Sergei S. Goncharov, Charles F. D. McCoy
Publication date: 10 September 2003
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-03-06951-x
model completecomputable modelstrongly minimalspectrum of computable modelsuncountably categoricaltrivial geometry
Computable structure theory, computable model theory (03C57) Quantifier elimination, model completeness, and related topics (03C10) Categoricity and completeness of theories (03C35)
Related Items
On the computability-theoretic complexity of trivial, strongly minimal models, Model completeness for trivial, uncountably categorical theories of Morley rank \(1\), Constructing \(\omega\)-stable structures: Model completeness., Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy, On two problems of Turing complexity for strongly minimal theories, A computable ℵ0-categorical structure whose theory computes true arithmetic, Recursive spectra of flat strongly minimal theories, Spectra of recursive models of disintegrated 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, Model completeness and relative decidability, The degrees of categorical theories with recursive models, IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE
