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 条
  • [31] The complexity of orbits of computably enumerable sets
    Cholak, Peter A.
    Downey, Rodney
    Harrington, Leo A.
    BULLETIN OF SYMBOLIC LOGIC, 2008, 14 (01) : 69 - 87
  • [32] Extension of embeddings in the computably enumerable degrees
    Slaman, TA
    Soare, RI
    ANNALS OF MATHEMATICS, 2001, 154 (01) : 1 - 43
  • [33] A Note on the Differences of Computably Enumerable Reals
    Barmpalias, George
    Lewis-Pye, Andrew
    COMPUTABILITY AND COMPLEXITY: ESSAYS DEDICATED TO RODNEY G. DOWNEY ON THE OCCASION OF HIS 60TH BIRTHDAY, 2017, 10010 : 623 - 632
  • [34] Cupping Computably Enumerable Degrees Simultaneously
    Tran, Hong Hanh
    Wu, Guohua
    UNITY OF LOGIC AND COMPUTATION, CIE 2023, 2023, 13967 : 3 - 16
  • [35] Extensions of embeddings in the computably enumerable degrees
    Zhao, Jitai
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 204 - 211
  • [36] UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
    Andrews, Uri
    Lempp, Steffen
    Miller, Joseph S.
    Keng Meng Ng
    Mauro, Luca San
    Sorbi, Andrea
    JOURNAL OF SYMBOLIC LOGIC, 2014, 79 (01) : 60 - 88
  • [37] COMPUTABLY ENUMERABLE SETS AND RELATED ISSUES
    Lavrov, I. A.
    ALGEBRA AND LOGIC, 2012, 50 (06) : 494 - 511
  • [38] Kolmogorov complexity and computably enumerable sets
    Barmpalias, George
    Li, Angsheng
    ANNALS OF PURE AND APPLIED LOGIC, 2013, 164 (12) : 1187 - 1200
  • [39] ALGEBRAIC ASPECTS OF THE COMPUTABLY ENUMERABLE DEGREES
    SLAMAN, TA
    SOARE, RI
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1995, 92 (02) : 617 - 621
  • [40] Jumps of computably enumerable equivalence relations
    Andrews, Uri
    Sorbi, Andrea
    ANNALS OF PURE AND APPLIED LOGIC, 2018, 169 (03) : 243 - 259
12345