Author:
Kalimullin I. Sh.,Puzarenko V. G.,Faizrakhmanov M. Kh.
Reference5 articles.
1. Yu. L. Ershov, Definability and
Computability (Nauchnaya Kniga, Novosibisrk, 1996; Consultants Bureau, New York,
1996).
2. W. Hodges, Model Theory
(Cambridge Univ. Press, Cambridge, 1993).
3. I. Sh. Kalimullin and V. G. Puzarenko, “Reducibility on families,” Algebra i
logika 48, 31 (2009) [Algebra and Logic 48, 20 (2009)].
4. I. Sh. Kalimullin, V. G. Puzarenko, and M. Kh. Faĭzrakhmanov,
“Negative numberings in admissible sets. I,” Mat. Trudy 26, no. 1, 47 (2023) [Siberian Adv. Math. 33, 293 (2023)].
5. V. G. Puzarenko, “Decidable computable $$\mathbb {A}
$$-numberings,” Algebra i logika 41, 568 (2002) [Algebra and Logic 41, 314 (2002)].