Please use this identifier to cite or link to this item:
|Title:||Properly Σ2 0 enumeration degrees and the high/low hierarchy|
|Citation:||Giorgi, M., Sorbi, A., Yang, Y. (2006-12). Properly Σ2 0 enumeration degrees and the high/low hierarchy. Journal of Symbolic Logic 71 (4) : 1125-1144. ScholarBank@NUS Repository. https://doi.org/10.2178/jsl/1164060448|
|Abstract:||We show that there exist downwards properly Σ2 0 (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree. © 2006, Association for Symbolic Logic.|
|Source Title:||Journal of Symbolic Logic|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 11, 2018
WEB OF SCIENCETM
checked on Oct 2, 2018
checked on Oct 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.