Prime models of theories of computable linear orderings

We answer a long-standing question of Rosenstein by exhibiting a complete t heory of linear orderings with both a computable model and a prime model, b ut no computable prime model. The proof uses the relativized version of the concept of limitwise monotonic function.