Extensions of Embeddings in the Computably Enumerable Degrees

Jitai Zhao

doi:10.1007/978-3-540-79228-4_18

Extensions of Embeddings in the Computably Enumerable Degrees

Jitai Zhao

https://doi.org/10.1007/978-3-540-79228-4_18

Copy DOI

Publication Date: Apr 25, 2008

Affiliation: University of Chinese Academy of Sciences, Institute of Software, Chinese Academy of Sciences

#Computably Enumerable Degrees #Computably Enumerable Turing Degrees + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In this paper, we study the extensions of embeddings in the computably enumerable Turing degrees. We show that for any c.e. degrees x n y, if either y is low or x is high, then there is a c.e. degree a such that both 0 < a ≤ x and x n y ∪ a hold.

Full Text