You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
The Bulletin of Symbolic Logic
Vol. 3, No. 4 (Dec., 1997), pp. 469-486
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/421100
Page Count: 18
You can always find the topics here!Topics: Polynomials, Recursion, Morphisms, Lambda calculus, Mathematical topoi, Natural numbers, Predicate logic, Functors, Isomorphism, Semantics
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PVω defines exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with ∑1b-induction over PVω and use this to re-establish that the provably total functions in this system are polynomial time computable. Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion.
The Bulletin of Symbolic Logic © 1997 Association for Symbolic Logic