On self-embeddings of computable linear orderings Export

@article{citeulike:566313, 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.}, author = {Downey, Rodney G. and Jockusch, Carl and Miller, Joseph S.}, booktitle = {New Zealand Institute of Mathematics and its Applications: Logic and Computation Programme}, citeulike-article-id = {566313}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.apal.2005.06.008}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6TYB-4GY86VB-2/2/7a3b10da18a47c8d79c9c0ea02300f6d}, doi = {10.1016/j.apal.2005.06.008}, journal = {Annals of Pure and Applied Logic}, keywords = {computable\_linear\_order, dushnikmiller, self-embedding}, month = {March}, number = {1-3}, pages = {52--76}, posted-at = {2006-03-27 23:33:48}, priority = {0}, title = {On self-embeddings of computable linear orderings}, url = {http://dx.doi.org/10.1016/j.apal.2005.06.008}, volume = {138}, year = {2006} }

TY - JOUR ID - citeulike:566313 L3 - citeulike-article-id:566313 N2 - 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. IS - 1-3 JF - Annals of Pure and Applied Logic EP - 76 TI - On self-embeddings of computable linear orderings VL - 138 T2 - New Zealand Institute of Mathematics and its Applications: Logic and Computation Programme SP - 52 KW - computable_linear_order KW - dushnikmiller KW - self-embedding AU - Downey, Rodney AU - Jockusch, Carl AU - Miller, Joseph PY - 2006/03// UR - http://dx.doi.org/10.1016/j.apal.2005.06.008 ER -