
In his book: Linear orderings [Academic Press, New York (1982; Zbl 0488.04002)], \textit{J. G. Rosenstein} asked if there was a complete theory of linear orderings with a computable model and a prime model, but no computable prime model. The author uses Khisamiev's technique of ``limitwise monotonic'' functions, together with coding a construction from the literature (specifically, \textit{R. J. Coles}, \textit{R. Downey} and \textit{B. Khoussainov} [Order 14, 107-124 (1998; Zbl 0915.03040)]) to give an affirmative answer to this longstanding question.
prime model, Models with special properties (saturated, rigid, etc.), computable model, Computable structure theory, computable model theory, Total orders, Models of other mathematical theories, Theory of numerations, effectively presented structures, complete theory of linear orderings
prime model, Models with special properties (saturated, rigid, etc.), computable model, Computable structure theory, computable model theory, Total orders, Models of other mathematical theories, Theory of numerations, effectively presented structures, complete theory of linear orderings
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
