Publisher
Springer Science and Business Media LLC
Reference9 articles.
1. Yu. L. Ershov,Definability and Computability [in Russian], Nauch. Kniga, Novosibirsk (1996).
2. V. A. Rudnev, “The existence of an inseparable pair in the recursive theory of admissible sets,”Algebra Logika,27, No. 1, 48–56 (1988).
3. V. A. Rudnev, “A universal recursive function on admissible sets,”Algebra Logika,25, No. 4, 425–435 (1986).
4. C. C. Chang and H. J. Keisler,Model Theory, North-Holland, Amsterdam (1973).
5. R. Yu. Vaitsenavithcyus, “Computable enumerations of computable functionals onRL-admissible sets,”Math. Log. Its Appl., Vol. 5, Institute of Mathematics and Cybernetics of the Lith. S.S.R. Academy of Science, Vilnyus (1987), pp. 123–132.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献