Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4662607 | Annals of Pure and Applied Logic | 2006 | 25 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic