Bounding prime models
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert Irving Soare · Journal of Symbolic Logic · 2004
Abstract. A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model of T decidable in X. It is easy to see that X = 0′ is prime bounding. Denisov claimed that every X