Tame Theories with Hyperarithmetic Homogeneous Models
Terrence S. Millar · Proceedings of the American Mathematical Society · 1989
A tame theory is a decidable first-order theory with only countably many countable models, and all complete types recursive. It is shown here that the recursive complexity of countable homogeneous models of tame theories is unbounded in the hyperarithmetic hierarchy.