On self-embeddings of computable linear orderings

被引：2
|
作者：
Downey, RG
Jockusch, C
Miller, JS
机构：
[1] Univ Connecticut, Dept Math, Storrs, CT 06269 USA
[2] Univ Illinois, Dept Math, Urbana, IL 61801 USA
[3] Victoria Univ Wellington, Sch Math & Comp Sci, Wellington, New Zealand
来源：
ANNALS OF PURE AND APPLIED LOGIC | 2006年 / 138卷 / 1-3期
基金：
中国国家自然科学基金;
关键词：
computable linear orders; Dushnik-Miller; self-embedding;
D O I：
10.1016/j.apal.2005.06.008
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The Dushnik-Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine compulability-theoretical aspects of this classical theorem. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：52 / 76
页数：25
相关论文
共 50 条
12345