1. M. M. Arslanov, ‘‘Generalizations of the recursion theorem,’’ Russ. Math. 228 (5), 9–16 (1981).
2. M. M. Arslanov, ‘‘Completeness in the arithmetical hierarchy and fixed-points,’’ Algebra Logic 28, 3–17 (1989).
3. M. M. Arslanov, ‘‘Generalized tabular reducibilities in infinite levels of ershov difference hierarchy,’’ in Logical Approaches to Computational Barriers, Proceedings of the CiE’2006 Conference, Ed. by A. Beckmann, J. Berger, B. Loewe, and J. V. Tacker (2006), pp. 15–23.
4. Truth-table complete computably enumerable sets;M. M. Arslanov,2003
5. H. P. Barendregt and S. A. Terwijn, ‘‘Fixed point theorems for precomplete numberings,’’ Ann. Pure Appl. Logic 170, 1151–1161 (2019).