On computable self-embeddings of computable linear orderings
Rodney G. Downey, Bart Kastermans, Steffen Lempp · Journal of Symbolic Logic · 2009
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.