On recursion theory in I∑
Journal of Symbolic Logic 54 (2):576 - 589 (1989)
| Abstract | It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJens 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.
C.-T. Chong (1984). Techniques of Admissible Recursion Theory. Springer-Verlag.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
J. Zashev (2001). On the Recursion Theorem in Iterative Operative Spaces. Journal of Symbolic Logic 66 (4):1727-1748.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,556 of 548,984 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
