Functionals defined by recursion.

Luis E. Sanchis

Notre Dame Journal of Formal Logic · 1967 · 43 citations · 3 references

DOIFull text

Open access

Concepts

Abstract

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

References

3