In this work we prove that for every pair of computably enumerable degrees a<Q b there exists a properly 2-computably enumerable degree d such that a <Q d <Q b, a isolates d from below, and b isolates d from above. Two ...