There exists a maximal 3-C.E. enumeration degree

S. Barry Cooper; Angsheng Li; Andrea Sorbi; Yue Yang

doi:10.1007/BF02785966

There exists a maximal 3-C.E. enumeration degree

S. Barry Cooper
, Angsheng Li
, Andrea Sorbi
, Yue Yang

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

We construct an incomplete 3-c.e. enumeration degree which is maximal among then-c.e. enumeration degrees for everyn with 3 ≤ n ≤ ω. Consequently then-c.e. enumeration degrees are not dense for any suchn. We show also that no lown-c.e. e-degree can be maximal among then-c.e. e-degrees, for 2 ≤ n ≤ ω.

源语言	英语
页（从-至）	285-320
页数	36
期刊	Israel Journal of Mathematics
卷	137
期	1
DOI	https://doi.org/10.1007/BF02785966
出版状态	已出版 - 12月 2003
已对外发布	是

访问文件

10.1007/BF02785966

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{b115c43dcc3b47e2a9916b16d5a87b97,

title = "There exists a maximal 3-C.E. enumeration degree",

abstract = "We construct an incomplete 3-c.e. enumeration degree which is maximal among then-c.e. enumeration degrees for everyn with 3 ≤ n ≤ ω. Consequently then-c.e. enumeration degrees are not dense for any suchn. We show also that no lown-c.e. e-degree can be maximal among then-c.e. e-degrees, for 2 ≤ n ≤ ω.",

author = "Cooper, \{S. Barry\} and Angsheng Li and Andrea Sorbi and Yue Yang",

year = "2003",

month = dec,

doi = "10.1007/BF02785966",

language = "英语",

volume = "137",

pages = "285--320",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - There exists a maximal 3-C.E. enumeration degree

AU - Cooper, S. Barry

AU - Li, Angsheng

AU - Sorbi, Andrea

AU - Yang, Yue

PY - 2003/12

Y1 - 2003/12

N2 - We construct an incomplete 3-c.e. enumeration degree which is maximal among then-c.e. enumeration degrees for everyn with 3 ≤ n ≤ ω. Consequently then-c.e. enumeration degrees are not dense for any suchn. We show also that no lown-c.e. e-degree can be maximal among then-c.e. e-degrees, for 2 ≤ n ≤ ω.

AB - We construct an incomplete 3-c.e. enumeration degree which is maximal among then-c.e. enumeration degrees for everyn with 3 ≤ n ≤ ω. Consequently then-c.e. enumeration degrees are not dense for any suchn. We show also that no lown-c.e. e-degree can be maximal among then-c.e. e-degrees, for 2 ≤ n ≤ ω.

UR - https://www.scopus.com/pages/publications/58449083287

U2 - 10.1007/BF02785966

DO - 10.1007/BF02785966

M3 - 文章

AN - SCOPUS:58449083287

SN - 0021-2172

VL - 137

SP - 285

EP - 320

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 1

ER -