Noncappable Enumeration Degrees Below $0'_e$
Cooper, S. Barry ; Sorbi, Andrea
J. Symbolic Logic, Tome 61 (1996) no. 1, p. 1347-1363 / Harvested from Project Euclid
We prove that there exists a noncappable enumeration degree strictly below $\mathbf{0}'_e$.
Publié le : 1996-12-14
Classification:  Enumeration operator,  enumeration degree,  $\Sigma^0_2$-set,  03D30
@article{1183745139,
     author = {Cooper, S. Barry and Sorbi, Andrea},
     title = {Noncappable Enumeration Degrees Below $0'\_e$},
     journal = {J. Symbolic Logic},
     volume = {61},
     number = {1},
     year = {1996},
     pages = { 1347-1363},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745139}
}
Cooper, S. Barry; Sorbi, Andrea. Noncappable Enumeration Degrees Below $0'_e$. J. Symbolic Logic, Tome 61 (1996) no. 1, pp.  1347-1363. http://gdmltest.u-ga.fr/item/1183745139/