@article{CM_1970__22_3_333_0,
author = {Gordon, Carl E.},
title = {Comparisons between some generalizations of recursion theory},
journal = {Compositio Mathematica},
pages = {333--346},
year = {1970},
publisher = {Wolters-Noordhoff Publishing},
volume = {22},
number = {3},
mrnumber = {285382},
zbl = {0235.02037},
language = {en},
url = {https://www.numdam.org/item/CM_1970__22_3_333_0/}
}
Gordon, Carl E. Comparisons between some generalizations of recursion theory. Compositio Mathematica, Tome 22 (1970) no. 3, pp. 333-346. https://www.numdam.org/item/CM_1970__22_3_333_0/
[G] A comparison of abstract computability theories, Doctoral Dissertation, University of California at Los Angeles (1968).
[K] Transfinite recursions on admissible ordinals. I, II (abstracts), J. Symb. Logic, 29 (1964), 162.
[RM] Recursion theory as a branch of model theory, Proc. of the third international congr. on Logic, Methodology and the Philos. of Sc., 1967, Amsterdam, 1968, 63-86. | Zbl | MR
[YNM] Abstract first order computability. I, II, . Trans. Amer. Math. Soc. 138 (1969), 427-464. | Zbl | MR
[P] Foundations of recursion theory, Doctoral Dissertation and supplement. Stanford University (1966).





