论文信息 - Elimination of higher type levels in definitions of primitive recursive functionals - 字舞流文

Elimination of higher type levels in definitions of primitive recursive functionals

Helmut Schwichtenberg | H. Schwichtenberg

[1] S. C. Kleene,et al. Extension of an effectively generated class of functions by enumeration , 1958 .

[2] W. Tait. Infinitely Long Terms of Transfinite Type , 1965 .

[3] Kurt Schütte,et al. Simultane Rekursionen in der Theorie der Funktionale endlicher Typen , 1971 .

[4] W. A. Howard. Assignment of Ordinals to Terms for Primitive Recursive Functionals of Finite Type , 1970 .

[5] G. Gentzen. Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[6] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .

[7] Georg Kreisel,et al. Mathematical significance of consistency proofs , 1958, Journal of Symbolic Logic.

[8] William W. Tait. Functionals Defined by Transfinite Recursion , 1965, J. Symb. Log..

[9] R. O. Gandy. Computable Functionals of Finite Type I , 1967 .

[10] Von Kurt Gödel,et al. ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[11] Sur une intégrale , 1959 .