Prime models of theories of computable linear orderings
Denis R. Hirschfeldt · Proceedings of the American Mathematical Society · 2001
We answer a long-standing question of Rosenstein by exhibiting a complete theory of linear orderings with both a computable model and a prime model, but no computable prime model. The proof uses the relativized version of the concept of limitwise monotonic function.