It is shown that for any computably enumerable degree , and any Turing degree , if , and c.e. in , then there exists a c.e. degree x with the following properties: , is splittable over , and .
S.B.Cooper and A.Li, Splitting and nonsplitting, II: A c.e. degree above which is not splittable, The Journal of S. Logic67(4) (2002), 1391–1430. doi:10.2178/jsl/1190150292.
2.
S.B.Cooper and A.Li, On Lachlan’s major sub-degree problem, Arch. Math. Log.47(4) (2008), 341–434. doi:10.1007/s00153-008-0083-5.
3.
R.W.Robinson, Interpolation and embedding in the recursively enumerable degrees, Annals of Mathematics93(2) (1971), 285–314. doi:10.2307/1970776.
4.
R.W.Robinson, Jump restricted interpolation in the recursively enumerable degrees, Annals of Mathematics93(2) (1971), 586–596. doi:10.2307/1970889.
5.
G.E.Sacks, On the degrees less than , Annals of Mathematics77(2) (1963), 211–231. doi:10.2307/1970214.
6.
G.E.Sacks, Recursive enumerability and the jump operator, Tran. Amer. Math. Soc.108 (1963), 223–239. doi:10.1090/S0002-9947-1963-0155747-3.
7.
R.I.Soare, Recursively Enumerable Sets and Degrees, Springer, 1987.
