Bounding and nonbounding minimal pairs in the enumeration degrees
Cooper, S. Barry ; Li, Angsheng ; Sorbi, Andrea ; Yang, Yue
J. Symbolic Logic, Tome 70 (2005) no. 1, p. 741-766 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show that every nonzero Δ⁰₂ e-degree bounds a minimal pair. On the other hand, there exist Σ⁰₂ e-degrees which bound no minimal pair.
Publié le : 2005-09-14
Classification:  03D30 
@article{1122038912,
     author = {Cooper, S. Barry and Li, Angsheng and Sorbi, Andrea and Yang, Yue},
     title = {Bounding and nonbounding minimal pairs in the enumeration degrees},
     journal = {J. Symbolic Logic},
     volume = {70},
     number = {1},
     year = {2005},
     pages = { 741-766},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1122038912}
}

Cooper, S. Barry; Li, Angsheng; Sorbi, Andrea; Yang, Yue. Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symbolic Logic, Tome 70 (2005) no. 1, pp.  741-766. http://gdmltest.u-ga.fr/item/1122038912/