Notre Dame Journal of Formal Logic · 1967 · 43 citations · 3 references
Natural SciencesComputer ScienceMathematicsCombinatoricsNumber TheoryTheory Of ComputationCombinatorial Number TheoryRecursion TheoryOperatorsRecursionRecursion OperatorsRecursive Types
Recursive functionals of finite type have been studied by several authors in recent years. The class of functionals that can be defined by primitive recursion of finite type is certainly more constructive than other more inclusive classes, as the general recursive functionals studied by Kleene. Moreover functionals defined by recursion are sufficient for the interpretation of formal systems of number theory in the manner described by Godel in
3
The paradox of Kleene and Rosser
Haskell B. Curry · Transactions of the American Mathematical Society · 1941 · 45 citations · Full text
Humanities, Mathematics, Philosophy +10
Recursive objects in all finite types
Andrzej Grzegorczyk · Fundamenta Mathematicae · 1964 · 27 citations · Full text
Luis E. Sanchis · Notre Dame Journal of Formal Logic · 1964 · 12 citations