Article contents
On computable self-embeddings of computable linear orderings
Published online by Cambridge University Press: 12 March 2014
Abstract
We solve a longstanding question of Rosenstein, and make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding.
The precise characterization of those computable linear orderings which have computable copies without nontrivial computable self-embedding remains open.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2009
References
REFERENCES
- 6
- Cited by