Bad Models in Nice Neighborhoods

This paper contains an example of a decidable theory which has 1) only a countable number of countable models (up to isomorphism); 2) a decidable saturated model; and 3) a countable homogeneous model that is not decidable. By the results in [1] and [2], this can happen if and only if the set of types realized by the homogeneous model (the type spectrum of the model) is not . If Γ and Σ are types of a theory T , define Γ ◁ Σ to mean that any model of T realizing Γ must realize Σ . In [3] a decidable theory is constructed that has only countably many countable models, only recursive types, but whose countable saturated model is not decidable. This is easy to do if the restriction on the number of countable models is lifted; the difficulty arises because the set of types must be recursively complex, and yet sufficiently related to control the number of countable models. In [3] the desired theory T is such that is a linear order with order type ω *. Also, the set of complete types of T is not . The last feature ensures that the countable saturated model is not decidable; the first feature allows the number of countable models to be controlled.