Cookies?
Library Header Image
LSE Research Online LSE Library Services

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

Full text not available from this repository.

Identification Number: 10.1016/j.apal.2005.10.001

Abstract

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

Item Type: Article
Official URL: http://www.journals.elsevier.com/annals-of-pure-an...
Additional Information: © 2006 Elsevier B.V.
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 06 Aug 2013 11:18
Last Modified: 27 Nov 2017 16:10
URI: http://eprints.lse.ac.uk/id/eprint/51430

Actions (login required)

View Item View Item