Translator Disclaimer
December 2009 On computable self-embeddings of computable linear orderings
Rodney G. Downey, Bart Kastermans, Steffen Lempp
J. Symbolic Logic 74(4): 1352-1366 (December 2009). DOI: 10.2178/jsl/1254748695

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.

Citation

Download Citation

Rodney G. Downey. Bart Kastermans. Steffen Lempp. "On computable self-embeddings of computable linear orderings." J. Symbolic Logic 74 (4) 1352 - 1366, December 2009. https://doi.org/10.2178/jsl/1254748695

Information

Published: December 2009
First available in Project Euclid: 5 October 2009

zbMATH: 1105.03036
MathSciNet: MR2583824
Digital Object Identifier: 10.2178/jsl/1254748695

Subjects:

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
15 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.74 • No. 4 • December 2009
Back to Top