Author:
Kalimullin I. Sh.,Puzarenko V. G.,Faizrakhmanov M. Kh.
Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. R. F. Friedberg, “Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication,” J. Symb. Log., 23, No. 3, 309-316 (1958).
2. Yu. L. Ershov, Definability and Computability, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1996).
3. V. G. Puzarenko, “Decidable computable $$ \mathbbm{A} $$-numberings,” Algebra and Logic, 41, No. 5, 314-322 (2002).
4. V. G. Puzarenko, “Computability in special models,” Sib. Math. J., 46, No. 1, 148-165 (2005).
5. I. Sh. Kalimullin, V. G. Puzarenko, and M. Kh. Faizrakhmanov, “Positive presentations of families relative to e-oracles,” Sib. Math. J., 59, No. 4, 648-656 (2018).