The ibT degrees of computably enumerable sets are not dense
Barmpalias, G. & Lewis-Pye, A.
(2006).
The ibT degrees of computably enumerable sets are not dense.
Annals of Pure and Applied Logic,
141(1-2), 51-60.
https://doi.org/10.1016/j.apal.2005.10.001
We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
| Item Type | Article |
|---|---|
| Copyright holders | © 2006 Elsevier B.V. |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1016/j.apal.2005.10.001 |
| Date Deposited | 06 Aug 2013 |
| URI | https://researchonline.lse.ac.uk/id/eprint/51430 |
Explore Further
- https://www.scopus.com/pages/publications/33747345033 (Scopus publication)
- http://www.journals.elsevier.com/annals-of-pure-an... (Official URL)