A problem in recursive function theory
Journal of Symbolic Logic 18 (3):225-232 (1953)
| 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,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesHeinrich Rolletschek (1983). Closure Properties of Almost-Finiteness Classes in Recursive Function Theory. Journal of Symbolic Logic 48 (3):756-763.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
H. R. Strong (1970). Construction of Models for Algebraically Generalized Recursive Function Theory. Journal of Symbolic Logic 35 (3):401-409.
Mark Changizi (1996). Function Identification From Noisy Data with Recursive Error Bounds. Erkenntnis 45 (1):91 - 102.
G. L. McColm (1989). Some Restrictions on Simple Fixed Points of the Integers. Journal of Symbolic Logic 54 (4):1324-1345.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
R. L. Goodstein (1961/2010). Recursive Analysis. Dover Publications.
Leonard M. Adleman & M. Blum (1991). Inductive Inference and Unsolvability. Journal of Symbolic Logic 56 (3):891-900.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #201,930 of 549,088 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
