Article contents
Equivalence of some definitions of recursion in a higher type object1
Published online by Cambridge University Press: 12 March 2014
Extract
In [4] Kleene gave a definition of recursive functionals of finite type. Later Sacks [5] and Harrington [2] gave definitions of recursion in normal functionals of finite type. These definitions, that Sacks and Harrington assumed equivalent as far as normal objects are concerned, are nevertheless very different: Kleene's definition is given in terms of an inductive definition; Sacks uses simultaneously a hierarchy (the S σ F's) and induction on the ordinals and on the type; Harrington's universe does not use the induction on the type but uses a hierarchy as Shoenfield [6]. In this paper we prove in detail that, as was expected, the three definitions are equivalent.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1976
Footnotes
The results in this paper are contained in the author's doctoral dissertation written under the supervision of G. E. Sacks and partially supported by a B.A.E.F. grant.
References
REFERENCES
- 1
- Cited by