Bounding cappable degrees

Angsheng Li

doi:10.1007/s001530050152

Bounding cappable degrees

Angsheng Li^*

^*此作品的通讯作者

CAS - Institute of Software

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

摘要

It will be shown that there exist computably enumerable degrees a and b such that a > b, and for any computably enumerable degree u, if u ≤ a and u is cappable, then u < b.

源语言	英语
页（从-至）	311-352
页数	42
期刊	Archive for Mathematical Logic
卷	39
期	5
DOI	https://doi.org/10.1007/s001530050152
出版状态	已出版 - 7月 2000
已对外发布	是

访问文件

10.1007/s001530050152

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{e74f08c30be74d8ab2d3f60e87c830e6,

title = "Bounding cappable degrees",

abstract = "It will be shown that there exist computably enumerable degrees a and b such that a > b, and for any computably enumerable degree u, if u ≤ a and u is cappable, then u < b.",

author = "Angsheng Li",

year = "2000",

month = jul,

doi = "10.1007/s001530050152",

language = "英语",

volume = "39",

pages = "311--352",

journal = "Archive for Mathematical Logic",

issn = "0933-5846",

publisher = "Springer New York",

number = "5",

}

TY - JOUR

T1 - Bounding cappable degrees

AU - Li, Angsheng

PY - 2000/7

Y1 - 2000/7

N2 - It will be shown that there exist computably enumerable degrees a and b such that a > b, and for any computably enumerable degree u, if u ≤ a and u is cappable, then u < b.

AB - It will be shown that there exist computably enumerable degrees a and b such that a > b, and for any computably enumerable degree u, if u ≤ a and u is cappable, then u < b.

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

U2 - 10.1007/s001530050152

DO - 10.1007/s001530050152

M3 - 文章

AN - SCOPUS:0034408764

SN - 0933-5846

VL - 39

SP - 311

EP - 352

JO - Archive for Mathematical Logic

JF - Archive for Mathematical Logic

IS - 5

ER -