Article ID Journal Published Year Pages File Type
4662644 Annals of Pure and Applied Logic 2006 10 Pages PDF
Abstract

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

Related Topics
Physical Sciences and Engineering Mathematics Logic
Preview
The degrees of computably enumerable sets are not dense