Prime models of theories of computable linear orderings (Q2723507)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Prime models of theories of computable linear orderings |
scientific article; zbMATH DE number 1614777
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Prime models of theories of computable linear orderings |
scientific article; zbMATH DE number 1614777 |
Statements
Prime models of theories of computable linear orderings (English)
0 references
5 July 2001
0 references
complete theory of linear orderings
0 references
computable model
0 references
prime model
0 references
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.
0 references
