Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T17:33:43.402Z Has data issue: false hasContentIssue false

On computable self-embeddings of computable linear orderings

Published online by Cambridge University Press:  12 March 2014

Rodney G. Downey
Affiliation:
School of Mathematics, Statistics and Computer Science, Victoria University, Wellington 6140, New Zealand, E-mail: Rod.Downey@mcs.vuw.ac.nz
Bart Kastermans
Affiliation:
Department of Mathematics, University of Colorado, Boulder, Co 80309-0395, USA, E-mail: bart.kastermans@colorado.edu
Steffen Lempp
Affiliation:
Department of Mathematics, University of Wisconsin, Madison, Wi 53706-1388, USA, E-mail: lempp@math.wisc.edu

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable