Variations on a theme by Weiermann

Journal of Symbolic Logic

Volumn 63, Issue 3, 1998, Pages 897-925

  Arai, Toshiyasu ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032259417     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586719     Document Type: Article

References (21)

1. T. ARAI, Some results on cut-elimination, provable well-orderings, induction and reflection, to appear in Annals of Pure and Applied Logic.
2. _, On Takeuti's fundamental conjecture (Japanese), Sûgaku, vol. 40 (1988), pp. 322-337, MR 90f:03091 and Zbl. Math. 689 03f:03026.
3. 2-reflecting ordinals, manuscript, February 1989.
4. _, A slow growing analogue to Buchholz' proof, Annals of Pure and Applied Logic, vol. 54 (1991), pp. 101-120.
5. _, Systems of ordinal diagrams, manuscript, August 1996.
6. _, Consistency proof via pointwise induction, Archives for Mathematical Logic, vol. 37(1998), pp. 149-165.
7. 1 - CA) + BI, Annals of Pure and Applied Logic, vol. 33 (1987), pp. 131-155.
8. _, Proof-theoretic analysis of termination proofs, Annals of Pure and Applied Logic, vol. 75 (1995), pp. 57-65.
9. W. BUCHHOLZ, E. A. CICHON, and A. WEIERMANN, A uniform approach to fundamental sequences and hierarchies, Mathematical Logic Quarterly, vol. 40 (1994), pp. 273-286.
10. E. A. CICHON, Termination orderings and complexity characterizations, Proof theory (P. Aczel et al., editors), Cambridge University Press, Cambridge, 1992, pp. 171-193.
11. H. FRIEDMAN and M. SHEARD, Elementary descent recursion and proof theory, Annals of Pure and Applied Logic, vol. 71 (1995), pp. 1-45.
12. P. HÁJEK and P. PUDLÁK, Metamathematics of first order arithmetic, Springer-Verlag, 1993.
13. W. POHLERS, A short course in ordinal analysis, Proof theory (P. Aczel et al., editors), Cambridge University Press, Cambridge, 1992, pp. 27-78.
14. U. R. SCHMERL, A fine structure generated by reflection formulas over primitive recursive arithmetic, Logic Colloquium 78 (M. Boffa, editor), North-Holland, Amsterdam, 1979, pp. 335-350.
15. R. SOMMER, Transfinite induction within Peano arithmetic, Annals of Pure and Applied Logic, vol. 76 (1995), pp. 231-289.
16. G. TAKEUTI, Proof theory, second ed., North-Holland, 1987.
17. A. WEIERMANN, Bounding derivation lengths with functions from the slow growing hierarchy, submitted.
18. _, How to characterize provably total functions by local predicativity, this JOURNAL, vol. 61 (1996), pp. 52-69.
19. _, On the slow growing hierarchy via Cichon's fundamental sequences, manuscript, February 1996.
20. _, Outer iteration together with lengths bounded transfinite recursion does not yield slow growingness, draft, April 1996.
21. _, Sometimes slow growing is fast growing, draft, April 1996.