1. R. I. Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic (Springer, Berlin, 1987).
2. M. M. Arslanov, “Truth–table complete computably enumerable sets,” in Computability and Models, Ed. by S. B. Cooper and S. S. Goncharov, The University Series in Mathematics (Springer, New York, 2020), pp. 1–10. https://doi.org/10.1007/978-1-4615-0755-0_1
3. M. M. Arslanov, “Completeness in the arithmetical hierarchy and fixed points,” Algebra Logic 28 (1), 1–9 (1989). https://doi.org/10.1007/BF01980603
4. M. M. Arslanov, “Some generalizations of a fixed-point theorem,” Sov. Math. 25 (5), 1–10 (1981).
5. V. D. Solov’ev, “Some generalizations of the notions of reducibility and creativity,” Sov. Math. 20 (3), 56–62 (1976).