Citation
As. Li et Dp. Yang, Bounding minimal degrees by computably enumerable degrees, J SYMB LOG, 63(4), 1998, pp. 1319-1347
Citations number
52
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF SYMBOLIC LOGIC
ISSN journal
00224812
→ ACNP
Volume
63
Issue
4
Year of publication
1998
Pages
1319 - 1347
Database
ISI
SICI code
0022-4812(199812)63:4<1319:BMDBCE>2.0.ZU;2-5
Abstract
In this paper, we prove that there exist computably enumerable degrees a an
d b such that a > b and for any degree x, if x less than or equal to a and
x is a minimal degree, then x < b.