In this paper, we study the extensions of embeddings in the computably enumerable Turing degrees. We show that for any c.e. degrees x ≤ 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 ≤ y ∪ a hold.
展开▼
