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 条

[31] Embeddings of Computable Structures
Kach, Asher M.
Levin, Oscar
Solomon, Reed
NOTRE DAME JOURNAL OF FORMAL LOGIC, 2010, 51 (01) : 55 - 68
[32] RECURSIVE EMBEDDINGS OF PARTIAL ORDERINGS
APT, KR
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1977, 29 (02): : 349 - 359
[33] On the complexity of the successivity relation in computable linear orderings (vol 10, pg 83, 2010)
Downey, Rodney G.
Lempp, Steffen
Wu, Guohua
JOURNAL OF MATHEMATICAL LOGIC, 2017, 17 (02)
[34] COMPUTABLE ALGEBRA AND GROUP EMBEDDINGS
BAUMSLAG, G
CANNONITO, FB
MILLER, CF
JOURNAL OF ALGEBRA, 1981, 69 (01) : 186 - 212
[35] Computable Linearizations of Well-partial-orderings
Antonio Montalbán
Order, 2007, 24 : 39 - 48
[36] Infinite chains and antichains in computable partial orderings
Herrmann, E
JOURNAL OF SYMBOLIC LOGIC, 2001, 66 (02) : 923 - 934
[37] Computable linearizations of well-partial-orderings
Montalban, Antonio
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2007, 24 (01): : 39 - 48
[38] Computable embeddings and strongly minimal theories
Chisholm, J.
Knight, J. F.
Miller, S.
JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (03) : 1031 - 1040
[39] A Note on Computable Embeddings for Ordinals and Their Reverses
Bazhenov, Nikolay
Vatev, Stefan
BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020, 2020, 12098 : 1 - 13
[40] Herrmann's Beautiful Theorem on Computable Partial Orderings
Jockusch, Carl G., Jr.
COMPUTABILITY AND COMPLEXITY: ESSAYS DEDICATED TO RODNEY G. DOWNEY ON THE OCCASION OF HIS 60TH BIRTHDAY, 2017, 10010 : 127 - 133

← 1 2 3 4 5 →