On self-embeddings of computable linear orderings

, &
Annals of Pure and Applied Logic 138 (1):52-76 (2006)
  Copy   BIBTEX

Abstract

The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2005.06.008

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,859

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Self-Embeddings of Computable Trees.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl & Reed Solomon - 2008 - Notre Dame Journal of Formal Logic 49 (1):1-37.
Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
The self-embedding theorem of WKL0 and a non-standard method.Kazuyuki Tanaka - 1997 - Annals of Pure and Applied Logic 84 (1):41-49.
Automorphisms of η-like computable linear orderings and Kierstead's conjecture.Charles M. Harris, Kyung Il Lee & S. Barry Cooper - 2016 - Mathematical Logic Quarterly 62 (6):481-506.
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.
Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.

Analytics

Added to PP
2013-12-31

Downloads
46 (#534,941)

6 months
12 (#291,784)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Computability theory and linear orders.Rod Downey - 1998 - In I︠U︡riĭ Leonidovich Ershov, Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.

Add more references