An Almost Deep Degree (1999)
by
Peter Cholak
,
Marcia Groszek
,
Theodore Slaman
| Venue: | J. Symbolic Logic |
| Citations: | 14 - 0 self |
BibTeX
@ARTICLE{Cholak99analmost,
author = {Peter Cholak and Marcia Groszek and Theodore Slaman},
title = {An Almost Deep Degree},
journal = {J. Symbolic Logic},
year = {1999},
volume = {66},
pages = {881--901}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 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.) 1
Citations
No citations identified.
