[1]Ambos-Spies, K., On the structure of the recursively enumerable degrees, Dissertation, Universität München, Munich, 1980.

[2]Ambos-Spies, K., *On pairs of recursively enumerable degrees, ***Transactions of the American Mathematical Society** (to appear).

[3]Cooper, S. B., Minimal upper bounds for sequences of recursively enumerable degrees, Journal of the London Mathematical Society, vol. 5 (1972), pp. 445–450.

[4]Fejer, P. A., *Structure of r.e. degrees* (Abstract), Conference on Mathematical Logic, Storrs, Connecticut, 1979.

[5]Fejer, P. A., and Soare, R. I., The plus-cupping theorem for the recursively enumerable degrees, Logic Year 1979-80, Lecture Notes in Mathematics, vol. 859, Springer-Verlag, Berlin, 1981, pp. 49–62.

[6]Friedberg, R. M., Two recursively enumerable sets of incomparable degrees of unsolvability, Proceedings of the National Academy of Sciences of the U.S.A., vol. 43 (1957), pp. 236–238.

[7]Lachlan, A. H., Lower bounds for pairs of r.e. degrees, Proceedings of the London Mathematical Society, ser. 3, vol. 16 (1966), pp. 537–569.

[8]Lachlan, A. H., Decomposition of recursively enumerable degrees, Proceedings of the American Mathematical Society, vol. 79 (1980), pp. 629–634.

[9]Lerman, M., On suborderings of the α.-recursively enumerable α-degrees, Annals of Mathematical Logic, vol. 4 (1972), pp. 369–392.

[10]Lerman, M., Least upper bounds for minimal pairs of a-r.e. x-degrees, this Journal, vol. 39 (1974), pp. 49–56.

[11]Lerman, M. and Sacks, G. E., Some minimal pairs of x-recursively enumerable degrees, Annals of Mathematical Logic, vol. 4 (1972), pp. 415–442.

[12]Miller, D. P., High recursively enumerable degrees and the anti-cupping property, Logic Year 1979-80, Lecture Notes in Mathematics, vol. 859, Springer-Verlag, Berlin, 1981, pp. 230–245.

[13]Muchnik, A. A., Negative answer to the problem of reducibility of the theory of algorithms (Russian), Doklady Akadémii Nauk SSSR, vol. 108 (1956), pp. 194–197.

[14]Robinson, R. W., Interpolation and embedding in the recursively enumerable degrees, Annals of Mathematics, vol. 93 (1971), pp. 285–314.

[15]Sacks, G. E., Degrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, Princeton, N.J., 1963.

[16]Shore, R. A., Splitting an α-recursively enumerable set, Transactions of the American Mathematical Society, vol. 204 (1975), pp. 65–77.

[17]Shore, R. A., On the jump of an α-recursively enumerable set, Transactions of the American Mathematical Society, vol. 217 (1976), pp. 351–363.

[18]Shore, R. A., >On the π∃-sentences of α-recursion theory, Generalized recursion theory. II (Fenstad, J. E., Gandy, R. O. and Sacks, G. E., editors), North-Holland, Amsterdam, 1978, pp. 331–353.

[19]Shore, R. A., Some constructions in α-recursion theory, Recursion theory: its generalisations and applications, London Mathematical Society Lecture Notes Series, vol. 45, Cambridge University Press, Cambridge, 1980, pp. 158–170.

[20]Simpson, S. G., Degree theory on admissible ordinals, Generalized recursion theory (Fenstad, J. E. and Hinman, P. G., editors), North-Holland, Amsterdam, 1974, pp. 165–193.

[21]Soare, R. I., The Friedberg-Muchnik theorem re-examined, Canadian Journal of Mathematics, vol. 24 (1972), pp. 1070–1078.

[22]Soare, R. I., Computational complexity, speedable and levelable sets, this Journal, vol. 42 (1977), pp. 545–563.

[23]Soare, R. I., Fundamental methods for constructing recursively enumerable degrees, Recursion theory: its generalisations and applications, London Mathematical Society Lecture Notes Series, vol. 45, Cambridge University Press, Cambridge, 1980, pp. 1–51.

[24]Yates, C. E. M., A minimal pair of r.e. degrees, this Journal, vol. 31 (1966), pp. 159–168.

[25]Yates, C. E. M., On the degrees of index sets. II, Transactions of the American Mathematical Society, vol. 135 (1969), pp. 249–266.