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.
| Property | Value |
|---|
| dbpprop:abstract
|
- 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.
|
| rdfs:comment
|
- 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.
|
| rdfs:label
|
- Primitive recursive functional
|
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
