Properly Σ⁰₂ enumeration degrees and the high/low hierarchy
Giorgi, Matthew ; Sorbi, Andrea ; Yang, Yue
J. Symbolic Logic, Tome 71 (2006) no. 1, p. 1125-1144 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show that there exist downwards properly Σ⁰₂ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.
Publié le : 2006-12-14
Classification:  03D30 
@article{1164060448,
     author = {Giorgi, Matthew and Sorbi, Andrea and Yang, Yue},
     title = {Properly S02 enumeration degrees and the high/low hierarchy},
     journal = {J. Symbolic Logic},
     volume = {71},
     number = {1},
     year = {2006},
     pages = { 1125-1144},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1164060448}
}

Giorgi, Matthew; Sorbi, Andrea; Yang, Yue. Properly Σ⁰₂ enumeration degrees and the high/low hierarchy. J. Symbolic Logic, Tome 71 (2006) no. 1, pp.  1125-1144. http://gdmltest.u-ga.fr/item/1164060448/