A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ )
暂无分享,去创建一个
[1] Keita Yokoyama,et al. On principles between ∑1- and ∑2-induction, and monotone enumerations , 2016, J. Math. Log..
[2] H. Friedman,et al. Independence of Ramsey theorem variants using , 2015 .
[3] Michael Rathjen,et al. The art of ordinal analysis , 2006 .
[4] William W. Tait,et al. Normal derivability in classical logic , 1968 .
[5] Arnold Beckmann,et al. Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory , 1998, Ann. Pure Appl. Log..
[6] Georg Kreisel,et al. Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems , 1968 .
[7] Stephen G. Simpson,et al. REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION , 2015, The Journal of Symbolic Logic.
[8] Patrick Dehornoy,et al. Unprovability results involving braids , 2007, 0711.3785.
[9] Richard Sommer,et al. Transfinite Induction within Peano Arithmetic , 1995, Ann. Pure Appl. Log..
[10] Harvey M. Friedman,et al. Elementary Descent Recursion and Proof Theory , 1995, Ann. Pure Appl. Log..
[11] H. Schwichtenberg. Proof Theory: Some Applications of Cut-Elimination , 1977 .
[12] K. Schütte. Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie , 1950 .
[13] Stephen G. Simpson,et al. Ordinal numbers and the Hilbert basis theorem , 1988, Journal of Symbolic Logic.