CiteULike is a free online bibliography manager. Register and you can start organising your references online.

On self-embeddings of computable linear orderings Export

Annals of Pure and Applied Logic In New Zealand Institute of Mathematics and its Applications: Logic and Computation Programme, Vol. 138, No. 1-3. (March 2006), pp. 52-76.

Citation Format

[Posts]

View FullText article


CLLC's tags for this article

computable_linear_order dushnikmiller self-embedding

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X 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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.