An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (Q4382502): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logical relations and the typed λ-calculus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3727946 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Provably total functions of intuitionistic bounded arithmetic / rank | |||
Normal rank | |||
Latest revision as of 10:38, 28 May 2024
scientific article; zbMATH DE number 1130680
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras |
scientific article; zbMATH DE number 1130680 |
Statements
An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (English)
0 references
28 February 2000
0 references
computable functions
0 references
category of presheaves over PTIME-functions
0 references
higher-order function algebra
0 references
generalisation of PTIME-computability to higher types
0 references
intuitionistic predicate logic
0 references
polynomial time
0 references
safe recursion
0 references
provably total functions
0 references
