Pages that link to "Item:Q3520239"
From MaRDI portal
The following pages link to On the Hierarchy of Intuitionistic Bounded Arithmetic (Q3520239):
Displaying 12 items.
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- A note on uniform density in weak arithmetical theories (Q2219096) (← links)
- Bounded arithmetic in free logic (Q2904624) (← links)
- The polynomial and linear time hierarchies in V<sup>0</sup> (Q3184215) (← links)
- (Q4035302) (← links)
- Two General Results on Intuitionistic Bounded Theories (Q4264539) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Characterizations of interpretability in bounded arithmetic (Q5213551) (← links)
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (Q5351967) (← links)
- An Independence Result for Intuitionistic Bounded Arithmetic (Q5477454) (← links)
- On different intuitionistic calculi and embeddings from Int to S4 (Q5955616) (← links)