Publisher Summary In the eighteen years since my last visit to Oslo, I have cherished a very pleasant recollection of an evening spent in the home of Thoralf Skolem. I am glad that the younger Norwegian logicians are keeping up the tradition so brilliantly started by him investigators from all parts have been pursuing higher and generalized recursion theory while I have been looking away. Also I am pleased to observe how many able In the theory developed in my original papers (1959 and 1963) on the subject I a m revisiting, there is a partial recursive function ϕ(σ 2 ,a) such that ϕ(λτ 1 θ,a,τ 1 ),a) to avoid this anomaly was not then pursued in depth is a partial recursive function of a for no completely defined (1963 LVI p. 110). A suggestion there (p.111) for extending the theory Platek in 1966 (to which my attention was drawn by Gandy 1967 p. 239) used my 1963 p. 110 example to show that the first recursion theorem (Kleene I M 1952a p. 348) does not hold in my 1959, 1963 theory ( as Ialsodidin 1963 LXVIpp. 120, 125). Platek developed a theory avoiding these anomalies by using what the called" hereditarily consistent" functionals. The present treatment (which for me is a resurrection of my 1963 p. 111 suggestion) gives the first recursion theorem a central role thinking along these lines before encountering Gandy 1967 and Platek 1966 exact relationship of the present treatment to Platek's and other work since 1963 remains to be clarified.
[1]
A. Church.
An Unsolvable Problem of Elementary Number Theory
,
1936
.
[2]
S. C. Kleene.
Recursive Functionals and Quantifiers of Finite Types Revisited II
,
1980
.
[3]
Dana S. Scott,et al.
Data Types as Lattices
,
1976,
SIAM J. Comput..
[4]
M. Levin,et al.
MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS
,
1974
.
[5]
Alan M. Turing,et al.
Computability and λ-definability
,
1937,
Journal of Symbolic Logic.
[6]
S. Kleene.
Recursive predicates and quantifiers
,
1943
.
[7]
R. Platek.
Foundations of recursion theory
,
1966
.
[8]
Alan M. Turing,et al.
Systems of Logic Based on Ordinals
,
2012,
Alan Turing's Systems of Logic.
[9]
S. C. Kleene,et al.
A note on recursive functions
,
1936
.
[10]
S. Kleene.
Hierarchies of number-theoretic predicates
,
1955
.
[11]
A. Turing.
On Computable Numbers, with an Application to the Entscheidungsproblem.
,
1937
.
[12]
S. C. Kleene,et al.
Recursive functionals and quantifiers of finite types. II
,
1959
.
[13]
S. Kleene.
General recursive functions of natural numbers
,
1936
.
[14]
Stephen Cole Kleene,et al.
On notation for ordinal numbers
,
1938,
Journal of Symbolic Logic.