On the Hierarchy of Intuitionistic Bounded Arithmetic
From MaRDI portal
Recommendations
Cited in
(17)- Bounded arithmetic and the polynomial hierarchy
- A note on uniform density in weak arithmetical theories
- Bounded arithmetic in free logic
- scientific article; zbMATH DE number 432703 (Why is no real title available?)
- The polynomial and linear time hierarchies in V0
- On intuitionistic elementary arithmetic
- scientific article; zbMATH DE number 4066875 (Why is no real title available?)
- scientific article; zbMATH DE number 176198 (Why is no real title available?)
- Two General Results on Intuitionistic Bounded Theories
- scientific article; zbMATH DE number 2152681 (Why is no real title available?)
- An intuitionistic formula hierarchy based on high‐school identities
- Characterizations of interpretability in bounded arithmetic
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
- An Independence Result for Intuitionistic Bounded Arithmetic
- On different intuitionistic calculi and embeddings from Int to S4
- On the unprovability of circuit size bounds in intuitionistic \(\mathsf{S}^1_2\)
- Provably recursive functions of constructive and relatively constructive theories
This page was built for publication: On the Hierarchy of Intuitionistic Bounded Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520239)