Primitive recursive functional: Difference between revisions

Revision as of 14:52, 17 May 2009

Latest revision as of 02:32, 9 December 2024

(8 intermediate revisions by 8 users not shown)

Line 1:

{{confuse|Primitive recursive function}}

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 intuitionistic 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.

Line 7 ⟶ 9:

== Background ==

Every primitive recursive functional has a type, which tellssays what kind of inputs it takes and what kind of output it produces. An object of type 0 is simply a natural number; it can also be viewed as a constant function that takes no input and returns an output in the set '''N''' of natural numbers.

For any two types σσ and ττ, the type σ→τσ→τ represents a function that takes an input of type σσ and returns an output of type ττ. Thus the function ''f''(''n'') = ''n''+1 is of type 0→00→0. The types (0→00→0)→0→0 and 0→0→(0→00→0) are different; by convention, the notation 0→0→00→0→0 refers to 0→0→(0→00→0). In the jargon of type theory, objects of type 0→00→0 are called ''functions'' and objects that take inputs of type other than 0 are called ''functionals''.

For any two types σσ and ττ, the type σ×τσ×τ represents an ordered pair, the first element of which has type σσ and the second element of which has type ττ. For example, consider the functional ''A'' takes as inputs a function ''f'' from '''N''' to '''N''', and a natural number ''n'', and returns ''f''(''n''). Then ''A'' has type (0 × (0→00→0))→0→0. This type can also be written as 0→0→(0→00→0)→0→0, by [[Curryingcurrying]].

The set of (pure) ''finite types'' is the smallest collection of types that includes 0 and is closed under the operations of × and →→. A superscript is used to indicate that a variable ''x''^ττ is assumed to have a certain type ττ; the superscript may be omitted when the type is clear from context.

== Definition ==

Line 20 ⟶ 22:

* The constant function ''f''(''n'') = 0 is a primitive recursive functional

* The successor function ''g''(''n'') = ''n'' + 1 is a primitive recursive functional

* For any type σ×τσ×τ, the functional K(''x''^σσ, ''y''^ττ) = ''x'' is a primitive recursive functional

* For any types ρρ, σσ, ττ, the functional

*::S(''r''^{ρ→σ→τρ→σ→τ},''s''^{ρ→σρ→σ}, ''t''^ρρ) = (''r''(''t''))(''s''(''t''))

*:is a primitive recursive functional

* For any type ττ, and ''f'' of type ττ, and any ''g'' of type 0→τ→τ0→τ→τ, the functional ''R''(''f'',''g'')^{0→τ0→τ} defined recursively as

*::''R''(''f'',''g'')(0) = ''f'',

*::''R''(''f'',''g'',)(''n''+1) = ''g''(''n'',''R''(''f'',''g'')(''n''))

*: is a primitive recursive functional

== See also ==

* [[Dialectica interpretation]]

* [[Higher-order function]]

* [[Primitive recursive function]]

* [[Simply typed lambda calculus]]

== References ==

Line 33 ⟶ 42:

* {{cite book

| title = Gödel's functional ("Dialectica") interpretation

| url = http://math.stanford.edu/~feferman/papers/dialectica.pdf

| author = [[Jeremy Avigad]] and [[Solomon Feferman]]

| publisher = in S. Buss ed., The Handbook of Proof Theory, North-Holland

| year = 1999

Line 40 ⟶ 50:

[[Category:Proof theory]]

[[Category:RecursionComputability theory]]

{{mathlogic-stub}}