Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], 2nd ed., Ekonomika, Moscow (2000).
2. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, Maidenhead, Berksh. (1967).
3. V. A. Rudnev, “A universal recursive function on admissible sets,” Algebra and Logic, 25, No. 4, 267-273 (1986).
4. Yu. L. Ershov, V. G. Puzarenko, and A. I. Stukachev, “ℍ𝔽-computability,” in Computability in Context. Computation and Logic in the Real World, S. B. Cooper and A. Sorbi (Eds.), Imperial College Press, London (2011), pp. 169-242.
5. A. S. Morozov and V. G. Puzarenko, “Σ-subsets of natural numbers,” Algebra and Logic, 43, No. 3, 162-178 (2004).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献