1. [14] Soare Robert I. , Recursively enumerable sets and degrees , Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.
2. [13] Soare Robert I. , Computational complexity, speedable and levelable sets, this Journal, vol. 42 (1977), no. 4, pp. 545–563.
3. A recursively enumerable degree which will not split over all lesser ones
4. [8] Jahn Michael A. , Implicit measurements of dynamic complexity properties and splittings of speedable sets, this Journal, vol. 64 (1999), no. 3, pp. 1037–1064.
5. [7] Friedberg Richard M. , Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication, this Journal, vol. 23 (1958), pp. 309–316.