K.Ambos-Spies, R.Downey and M.Monath, Notes on sacks splitting theorem, in preparation.
3.
K.Ambos-Spies, C.Jockusch, R.Shore and R.Soare, An algebraic decomposition of recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Trans. Amer. Math. Soc.281 (1984), 109–128. doi:10.1090/S0002-9947-1984-0719661-8.
4.
M.Bickford and C.F.Mills, Lowness properties of r.e. sets, unpublished.
5.
E.Chih, Non-splitting of recursively enumerable sets, J. Symb. Logic80 (2015), 609–635. doi:10.1017/jsl.2014.83.
6.
R.Downey and N.Greenberg, A hierarchy of low computably enumerable degrees, unifying classes and natural definability, 172 pp., Submitted.
7.
R.Downey, C.Jockush and P.E.Schupp, Asymptotic density and computably enumerable sets, Journal of Mathematical Logic13 (2013), 43 pages. doi:10.1142/S0219061313500050.
8.
R.G.Downey and D.R.Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, 2010.
9.
R.G.Downey and K.M.Ng, Splitting into degrees with low computational strength, Annals of Pure and Applied Logic, accepted.
10.
R.G.Downey and R.Shore, Splitting theorems and the jump operator, Annals Pure and Applied Logic94 (1998), 45–52. doi:10.1016/S0168-0072(97)00066-3.
11.
R.G.Downey and T.A.Slaman, Completely mitotic r.e. degrees, Ann. Pure Appl. Logic41 (1989), 119–152. doi:10.1016/0168-0072(89)90011-0.
12.
R.G.Downey and M.Stob, Splitting theorems in recursion theory, Ann. Pure Appl. Logic65 (1993), 1–106. doi:10.1016/0168-0072(93)90234-5.
13.
R.Friedberg, Three theorems on recursive enumeration, J. Symbolic Logic23 (1958), 308–316.
14.
E.Griffiths, Completely mitotic c.e. degrees and non-jump inversion, Annals of Pure and Applied Logic132 (2005), 181–207. doi:10.1016/j.apal.2004.06.008.
15.
M.Ingrassia and S.Lempp, Jumps of nontrivial splittings of r.e. sets, Z math. Logic. Grundlagen Math.36 (1990), 285–292. doi:10.1002/malq.19900360403.
