A New Spectrum of Recursive Models
We describe a strongly minimal theory S in an effective language such that, in the chain of countable models of S, only the second model has a computable presentation. Thus there is a spectrum of an -categorical theory which is neither upward nor downward closed. We also give an upper bound on the complexity of spectra.
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1022615611
Mathematical Reviews number (MathSciNet): MR1845630
Digital Object Identifier: doi:10.1305/ndjfl/1022615611
Zentralblatt MATH identifier: 1007.03036