A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains

被引：0

作者：

A. S. Morozov

机构：

[1] Sobolev Institute of Mathematics Novosibirsk State University,

来源：

Siberian Mathematical Journal | 2018年 / 59卷

关键词：

computable order; computably enumerable order; chain; antichain;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.

引用

页码：463 / 469

页数：6

共 50 条

[41] On Dark Computably Enumerable Equivalence Relations
Bazhenov, N. A.
Kalmurzaev, B. S.
SIBERIAN MATHEMATICAL JOURNAL, 2018, 59 (01) : 22 - 30
[42] Computably enumerable algebras, their expansions, and isomorphisms
Khoussainov, B
Lempp, S
Slaman, TA
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2005, 15 (03) : 437 - 454
[43] THE NONLOW COMPUTABLY ENUMERABLE DEGREES ARE NOT INVARIANT IN ε
Epstein, Rachel
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2013, 365 (03) : 1305 - 1345
[44] Automorphism groups of computably enumerable predicates
Combarro E.F.
Algebra and Logic, 2002, 41 (5) : 285 - 294
[45] ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
Downey, Rodney G.
Jockusch, Carl G., Jr.
Schupp, Paul E.
JOURNAL OF MATHEMATICAL LOGIC, 2013, 13 (02)
[46] Definable encodings in the computably enumerable sets
Cholak, PA
Harrington, LA
BULLETIN OF SYMBOLIC LOGIC, 2000, 6 (02) : 185 - 196
[47] Almost computably enumerable families of sets
Kalimullin, I. Sh.
SBORNIK MATHEMATICS, 2008, 199 (9-10) : 1451 - 1458
[48] Isomorphisms of splits of computably enumerable sets
Cholak, PA
Harrington, LA
JOURNAL OF SYMBOLIC LOGIC, 2003, 68 (03) : 1044 - 1064
[49] An interval of computably enumerable isolating degrees
Salts, MC
MATHEMATICAL LOGIC QUARTERLY, 1999, 45 (01) : 59 - 72
[50] On orbits of prompt and low computably enumerable sets
Wald, K
JOURNAL OF SYMBOLIC LOGIC, 2002, 67 (02) : 649 - 678

← 1 2 3 4 5 →