Which number theoretic problems can be solved in recursive progressions on π 1/1-paths through o?
Journal of Symbolic Logic 37 (2):311-334 (1972)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPeter Clote (1986). A Generalization of the Limit Lemma and Clopen Games. Journal of Symbolic Logic 51 (2):273-291.
L. D. Beklemishev (1991). Provability Logics for Natural Turing Progressions of Arithmetical Theories. Studia Logica 50 (1):107 - 128.
David Hodgson (1996). The Easy Problems Ain't so Easy. Journal of Consciousness Studies 3 (1):69-75.
Juichi Shinoda & Theodore A. Slaman (2000). Recursive in a Generic Real. Journal of Symbolic Logic 65 (1):164-172.
Leonard M. Adleman & M. Blum (1991). Inductive Inference and Unsolvability. Journal of Symbolic Logic 56 (3):891-900.
Jens Erik Fenstad (1968). On the Completeness of Some Transfinite Recursive Progressions of Axiomatic Theories. Journal of Symbolic Logic 33 (1):69-76.
Solomon Feferman (1962). Transfinite Recursive Progressions of Axiomatic Theories. Journal of Symbolic Logic 27 (3):259-316.
S. Feferman & C. Spector (1962). Incompleteness Along Paths in Progressions of Theories. Journal of Symbolic Logic 27 (4):383-390.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,008 of 549,122 )Recent downloads (6 months)1 ( #63,361 of 549,122 )How can I increase my downloads? |
My notes
Discussion
