Groundwork for weak analysis

Journal of Symbolic Logic

Volumn 67, Issue 2, 2002, Pages 557-578

  Fernandes, António M ^a   Ferreira, Fernando ^b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Interpretability; Polytime computability; Weak analysis

Indexed keywords

EID: 0036017420     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1190150098     Document Type: Article

References (29)

1. Asymmetric interpretations for bounded theories
2. Polynomial time computable arithmetic
3. Stockmeyer induction
4. On end-extensions of models of ¬exp
5. Metamathematics of first-order arithmetic
6. 0 induction
7. Models of Peano arithmetic
8. Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
9. Arithmetizing proofs in analysis
10. Proof theory computational analysis
11. Predicative arithmetic
12. An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic
13. Subsystems of second-order arithmetic
14. Reverse algebra
15. 0 induction
16. RSUV isomorphisms
17. Reverse mathematics and basic feasible systems of 0-1 strings
18. Some more conservation results on the Baire category theorem