Decidability and the number of countable models (Q1057259)

Examples are known of decidable complete theories, with only recursive complete types, that have undecidable countable models. All such examples have been theories with \(2^{\aleph_ 0}\) countable models. The author's aim is to present such a theory that has only countable many countable models, and for which the countable, saturated model is undecidable. In J. Symb. Logic 48, 171-181 (1983; Zbl 0516.03017), the author proves that if a theory has the property that no decidable model is prime over a finite expansion, then the theory has \(2^{\aleph_ 0}\) countable models. Thus the offered example also ''highlights another difference between the properties of being prime versus saturated''.