1. M. M. Arslanov, ‘‘Completeness in the arithmetical hierarchy and fixed-point theorems,’’ Algebra Logic 28, 3–17 (1989).
2. Truth table complete computably enumerable sets;M. M. Arslanov,2002
3. M. M. Arslanov, ‘‘On some generalizations of the fixed-point theorems,’’ Russ. Math. 228 (5), 9–16 (1981).
4. V. D. Solov’ev, ‘‘Some generalizations of notions of productiveness and creativeness,’’ Russ. Math. 3, 65–72 (1976).
5. I. I. Batyrshin, ‘‘Quasi-completeness and functions without fixed-point,’’ Math. Logic Quart. 52, 595–601 (2006).