The ibT degrees of computably enumerable sets are not dense

Barmpalias, George; and Lewis-Pye, Andrew (2006) The ibT degrees of computably enumerable sets are not dense Annals of Pure and Applied Logic, 141 (1-2). pp. 51-60. ISSN 0168-0072

Copy

We show that the identity bounded Turing degrees of computably enumerable sets are not dense.

Item Type	Article
Departments	Mathematics
DOI	10.1016/j.apal.2005.10.001
Date Deposited	06 Aug 2013 11:18
URI	https://researchonline.lse.ac.uk/id/eprint/51430

Explore Further

Barmpalias, George
Lewis-Pye, Andrew

QA Mathematics

http://www.journals.elsevier.com/annals-of-pure-an... (Official URL)

Full text not available from this repository.

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads