Publisher
Springer Nature Switzerland
Reference33 articles.
1. Badaev, S.A., Sorbi, A.: Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62(1–2), 111–127 (2016)
2. Bauer, A.: On fixed-point theorems in synthetic computability. Tbilisi Math. J. 10(3), 167–181 (2017)
3. Lecture Notes in Computer Science;U Andrews,2017
4. Arslanov, M.M.: On some generalizations of the fixed point theorem. Sov. Math. (Izvestiya VUZ. Matematika) 25(5), 1–10 (1981). (English translation)
5. Arslanov, M.M.: Fixed-point selection functions. Lobachevskii J. Math. 42, 685–692 (2021)