Primitive recursive functional: Difference between revisions

Revision as of 12:37, 17 May 2009

Revision as of 14:50, 17 May 2009

Line 1:

In [[mathematical logic]], the '''primitive recursive functionals''' are a generalization of [[primitive recursive functions]] into higher [[type theory]]. They consist of a collection of functions in all pure finite types.

The primitive recursive functionals are important in [[proof theory]] and [[constructive mathematics]] They are a central part of the [[Dialectica interpretation]] of isolationisticintuitionistic arithmetic developed by [[Kurt Gödel]].

In [[recursion theory]], the primitive recursive functionals are an example of higher-type computability, as primitive recursive functions are examples of Turing computability.

== Background ==