Provably total functions of intuitionistic bounded arithmetic
From MaRDI portal
Publication:4032632
Recommendations
Cites work
Cited in
(15)- Provably recursive functions of constructive and relatively constructive theories
- Functional interpretations of feasibly constructive arithmetic
- Feasible functions over co-inductive data
- Mining the surface: witnessing the low complexity theorems of arithmetic
- Preservation theorems for bounded formulas
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
- Classifying the Provably Total Functions of PA
- Computation models and function algebras
- Type 2 polynomial hierarchies
- scientific article; zbMATH DE number 7324257 (Why is no real title available?)
- A tight relationship between generic oracles and type-2 complexity theory
- An Independence Result for Intuitionistic Bounded Arithmetic
- scientific article; zbMATH DE number 440477 (Why is no real title available?)
- On parallel hierarchies and R_k^i
- Effectiveness and provability
This page was built for publication: Provably total functions of intuitionistic bounded arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032632)