Comparisons between some generalizations of recursion theory
Gordon, Carl E.
Compositio Mathematica, Tome 22 (1970), p. 333-346 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1970-01-01
@article{CM_1970__22_3_333_0,
     author = {Gordon, Carl E.},
     title = {Comparisons between some generalizations of recursion theory},
     journal = {Compositio Mathematica},
     volume = {22},
     year = {1970},
     pages = {333-346},
     mrnumber = {285382},
     zbl = {0235.02037},
     language = {en},
     url = {http://dml.mathdoc.fr/item/CM_1970__22_3_333_0}
}

Gordon, Carl E. Comparisons between some generalizations of recursion theory. Compositio Mathematica, Tome 22 (1970) pp. 333-346. http://gdmltest.u-ga.fr/item/CM_1970__22_3_333_0/

C. Gordon [G] A comparison of abstract computability theories, Doctoral Dissertation, University of California at Los Angeles (1968).

S. Kripke [K] Transfinite recursions on admissible ordinals. I, II (abstracts), J. Symb. Logic, 29 (1964), 162.

R. Montague [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. | MR 272624 | Zbl 0247.02040

Y.N. Moschovakis [YNM] Abstract first order computability. I, II, . Trans. Amer. Math. Soc. 138 (1969), 427-464. | MR 244045 | Zbl 0218.02038

R. Platek [P] Foundations of recursion theory, Doctoral Dissertation and supplement. Stanford University (1966).