1. E. A. Polyakov and M. G. Rozinas, Theory of Algorithms [in Russian], Ivanovo State Univ. (1976).
2. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
3. C. G. Jockusch, "Semirecursive sets and positive reducibility," Trans. Am. Math. Soc.,131, No. 2, 420–436 (1968).
4. R. Sh. Omanadze, "On the upper semilattice of recursively enumerable Q-degrees," Algebra Logika,23, No. 2, 175–184 (1984).