An Almost Deep Degree
Cholak, Peter ; Groszek, Marcia ; Slaman, Theodore
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 881-901 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show there is a non-recursive r.e. set A such that if W is any low r.e. set, then the join W $\oplus$ A is also low. That is, A is "almost deep". This answers a question of Jockusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.)
Publié le : 2001-06-14
Classification:  
@article{1183746480,
     author = {Cholak, Peter and Groszek, Marcia and Slaman, Theodore},
     title = {An Almost Deep Degree},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 881-901},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746480}
}

Cholak, Peter; Groszek, Marcia; Slaman, Theodore. An Almost Deep Degree. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  881-901. http://gdmltest.u-ga.fr/item/1183746480/