Author:
Kalimullin∗ I. Sh.,Puzarenko∗∗ V. G.
Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. S. S. Goncharov, V. S. Harizanov, J. F. Knight, C. McCoy, R. G. Miller, and R. Solomon, “Enumerations in computable structure theory,” Ann. Pure Appl. Log., 136, No. 3, 219–246 (2005).
2. Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).
3. V. G. Puzarenko, “A reducibility on admissible sets,” Sib. Mat. Zh., 50, No. 2 (2009).
4. R. I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Springer, Berlin (1987).
5. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献