Extensions of embeddings in the computably enumerable degrees

  • Authors:

  • Jitai Zhao

  • Affiliations:

  • State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences and Graduate University of Chinese Academy of Sciences

  • Venue:
  • TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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