Bounding cappable degrees

Angsheng Li

doi:10.1007/s001530050152

Bounding cappable degrees

Angsheng Li^*

^*Corresponding author for this work

CAS - Institute of Software

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	311-352
Number of pages	42
Journal	Archive for Mathematical Logic
Volume	39
Issue number	5
DOIs	https://doi.org/10.1007/s001530050152
State	Published - Jul 2000
Externally published	Yes

Access to Document

10.1007/s001530050152

Cite this

@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 -

Bounding cappable degrees

Abstract

Access to Document

Other files and links

Cite this