The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
Barmpalias, George ; Lewis, Andrew E. M.
Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, p. 361-370 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand, we know that there are intervals which contain no hypersimple set.
Publié le : 2006-07-14
Classification:  hypersimple,  weak truth table degrees,  density,  03F60,  03D30 
@article{1163775443,
     author = {Barmpalias, George and Lewis, Andrew E. M.},
     title = {The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees},
     journal = {Notre Dame J. Formal Logic},
     volume = {47},
     number = {1},
     year = {2006},
     pages = { 361-370},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1163775443}
}

Barmpalias, George; Lewis, Andrew E. M. The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, pp.  361-370. http://gdmltest.u-ga.fr/item/1163775443/