Proceedings of the American Mathematical Society
We prove that if M is any model of a trivial, strongly minimal theory, then the elementary diagram Th(MM) is a model complete LM-theory. We conclude that all countable models of a trivial, strongly minimal theory with at least one computable model are 0"-decidable, and that the spectrum of computable models of any trivial, strongly minimal theory is Σ05.
Citation: Pilot Scholars Version (Modified MLA Style)
Goncharov, Sergey S.; Harizanov, Valentina S.; Laskowski, Michael C.; Lempp, Steffen; Solomon, Reed; and Mccoy, Charles F. D., "Trivial, Strongly Minimal Theories Are Model Complete After Naming Constants" (2003). Mathematics Faculty Publications and Presentations. Paper 7.