Comparisons between some generalizations of recursion theory
Compositio Mathematica (1970)
- Volume: 22, Issue: 3, page 333-346
- ISSN: 0010-437X
Access Full Article
top
How to cite
topGordon, Carl E.. "Comparisons between some generalizations of recursion theory." Compositio Mathematica 22.3 (1970): 333-346. <http://eudml.org/doc/89063>.
@article{Gordon1970,
author = {Gordon, Carl E.},
journal = {Compositio Mathematica},
language = {eng},
number = {3},
pages = {333-346},
publisher = {Wolters-Noordhoff Publishing},
title = {Comparisons between some generalizations of recursion theory},
url = {http://eudml.org/doc/89063},
volume = {22},
year = {1970},
}
TY - JOUR
AU - Gordon, Carl E.
TI - Comparisons between some generalizations of recursion theory
JO - Compositio Mathematica
PY - 1970
PB - Wolters-Noordhoff Publishing
VL - 22
IS - 3
SP - 333
EP - 346
LA - eng
UR - http://eudml.org/doc/89063
ER -
References
top- 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. Zbl0247.02040MR272624
- Y.N. Moschovakis [YNM] Abstract first order computability. I, II, . Trans. Amer. Math. Soc.138 (1969), 427-464. Zbl0218.02038MR244045
- R. Platek [P] Foundations of recursion theory, Doctoral Dissertation and supplement. Stanford University (1966).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.