Tags
On self-embeddings of computable linear orderings
| RIS |
Export as RIS which can be imported into most citation managers |
| BibTeX |
Export as BibTeX which can be imported into most citation/bibliography managers |
| PDF |
Export formatted citations as PDF |
| RTF |
Export formatted citations as RTF which can be imported into most word processors |
Delicious  |
Export in format suitable for direct import into delicious.com. (Setup a permanent sync to delicious)
|
| Formatted Text |
Export formatted citations as plain text |
To insert individual citation into a bibliography in a word-processor,
select your preferred citation style below and drag-and-drop it into the document.
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.
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.
CLLC's tags for this article
There are no reviews of this article
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.
Search
There are no reviews yet
