Relative enumerability and the $d$-c. e. degrees

M. M. Arslanov

Department of Algebra and Mathematical Logic, Kazan Federal University, Kazan, Russia

Abstract: We study the relationship between the relative enumerability and the $d$-c. e. degrees. We prove that the degree of the halting problem is splittable into two c. e. degrees such that the upper cone of each of them contains only $d$-c. e. degrees which are c. e. in another one.

Keywords: Turing degrees, computably enumerable degrees, relative computable enumerability, splitting, definability.

UDC: 510.532

Received: 15.12.2010

Language: English