1. Andrews, U., Badaev, S.A.: On isomorphism classes of computably enumerable equivalence relations. J. Symb. Log. 85(1), 61–86 (2020)
2. Andrews, U., Badaev, S.A., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Day, A.R., Fellows, M.R., Greenberg, N., Khoussainov, B., Melnikov, A.G., Rosamond, F.A. (eds.) Computability and Complexity—Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, Volume 10010 of Lecture Notes Computer Science, pp. 418–451. Springer, Cham (2017)
3. Arslanov, M.M.: On some generalizations of a fixed point theorem. Sov. Math. 25(5), 1–10 (1981)
4. Arslanov, M.M.: Completeness in the arithmetical hierarchy and fixed points. Algebra Logic 28(1), 1–9 (1989)
5. Arslanov, M.M.: Fixed-point selection functions. Lobachevskii J. Math. 42(4), 685–692 (2021)