Generalized Recursion Theory
Jens Erik Fenstad & Peter G. Hinman (eds.)
New York,American Elsevier Pub. Co. (1974)
| Abstract | Provability, Computability and Reflection | |||||||||
| Keywords | Recursion theory Congresses | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Buy the book | $565.98 new Amazon page | |||||||||
| Call number | QA9.6.S95 1972 | |||||||||
| ISBN(s) | 044410545X 9780444105455 | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
|
| Through your library | Configure |
C.-T. Chong (1984). Techniques of Admissible Recursion Theory. Springer-Verlag.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.
Peter G. Hinman (1978). Recursion-Theoretic Hierarchies. Springer-Verlag.
Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,651 of 549,070 )Recent downloads (6 months)0How can I increase my downloads? |

