The following pages link to A feasible theory for analysis (Q4314687):
Displayed 13 items.
- Bounded functional interpretation and feasible analysis (Q866559) (← links)
- Harrington's conservation theorem redone (Q948908) (← links)
- The counting hierarchy in binary notation (Q1008842) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- Bounded functional interpretation (Q2488269) (← links)
- Strict \({\varPi^1_1}\)-reflection in bounded arithmetic (Q2655140) (← links)
- Groundwork for weak analysis (Q3149983) (← links)
- 2006 Annual Meeting of the Association for Symbolic Logic (Q3594488) (← links)
- Polynomial time operations in explicit mathematics (Q4358055) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- 2003 Annual Meeting of the Association for Symbolic Logic (Q4678936) (← links)
- Forcing in Proof Theory (Q4678943) (← links)
- Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)