Prime models of theories of computable linear orderings
Copyright policy )Prime models of theories of computable linear orderings
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.
- University of Chicago United States
- Victoria University of Wellington New Zealand
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
Citations provided by BIP!Popularity provided by BIP!