Abstract
AbstractWe discuss the (non)effectivity of Arslanov’s completeness criterion. In particular, we show that a parameterized version, similar to the recursion theorem with parameters, fails. We also discuss the effectivity of another extension of the recursion theorem, namely Visser’s ADN theorem, as well as that of a joint generalization of the ADN theorem and Arslanov’s completeness criterion.
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Arslanov, M.M.: On some generalizations of the fixed point theorem. Sov. Math. (Izv. VUZ. Mat.) 25(5), 1–10 (1981)
2. Barendregt, H.: Representing undefined in lambda calculus. J. Funct. Program. 2(3), 367–374 (1992)
3. Bernardi, C., Sorbi, A.: Classifying positive equivalence relations. J. Symb. Log. 48(3), 529–538 (1983)
4. Crossley, J.N.: Reminiscences of logicians. In: Crossley, J.N. (ed.) Algebra and Logic, pp. 1–62. Springer, Berlin (1975)
5. Jockusch Jr., C.G., Lerman, M., Soare, R.I., Solovay, R.M.: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov’s completeness criterion. J. Symb. Log. 54(4), 1288–1323 (1989)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献