Prime Models of Theories of Computable Linear Orderings

by Denis R. Hirschfeldt



Status: published in the Proceedings of the American Mathematical Society, vol. 129 (2001), pp. 3079 - 3083.

Availability: DVI and PostScript

Abstract.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.



drh@math.uchicago.edu