Book contents
- Frontmatter
- Preface
- Contents
- Possible m-diagrams ofmodels of arithmetic
- Weak theories of nonstandard arithmetic and analysis
- Notions of compactness in weak subsystems of second order arithmetic
- Proof-theoretic strength of the stable marriage theorem and other problems
- Free sets and reversemathematics
- Interpreting arithmetic in the r.e. degrees under Σ4-induction
- Reverse mathematics, Archimedean classes, and Hahn's Theorem
- The Baire category theoremover a feasible base theory
- Basic applications of weak König's lemma in feasible analysis
- Maximal nonfinitely generated subalgebras
- Metamathematics of comparability
- A note on compactness of countable sets
- A survey of the reversemathematics of ordinal arithmetic
- Reversemathematics and ordinal suprema
- Did Cantor need set theory?
- Models of arithmetic: quantifiers and complexity
- Higher order reversemathematics
- Arithmetic saturation
- WQO and BQO theory in subsystems of second order arithmetic
- Reverse mathematics and graph coloring: eliminating diagonalization
- Undecidable theories and reversemathematics
- Π01 sets and models of WKL0
- Manipulating the reals in RCA0
- Reverse mathematics and weak systems of 0-1 strings for feasible analysis
- References
Free sets and reversemathematics
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- Possible m-diagrams ofmodels of arithmetic
- Weak theories of nonstandard arithmetic and analysis
- Notions of compactness in weak subsystems of second order arithmetic
- Proof-theoretic strength of the stable marriage theorem and other problems
- Free sets and reversemathematics
- Interpreting arithmetic in the r.e. degrees under Σ4-induction
- Reverse mathematics, Archimedean classes, and Hahn's Theorem
- The Baire category theoremover a feasible base theory
- Basic applications of weak König's lemma in feasible analysis
- Maximal nonfinitely generated subalgebras
- Metamathematics of comparability
- A note on compactness of countable sets
- A survey of the reversemathematics of ordinal arithmetic
- Reversemathematics and ordinal suprema
- Did Cantor need set theory?
- Models of arithmetic: quantifiers and complexity
- Higher order reversemathematics
- Arithmetic saturation
- WQO and BQO theory in subsystems of second order arithmetic
- Reverse mathematics and graph coloring: eliminating diagonalization
- Undecidable theories and reversemathematics
- Π01 sets and models of WKL0
- Manipulating the reals in RCA0
- Reverse mathematics and weak systems of 0-1 strings for feasible analysis
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Reverse Mathematics 2001 , pp. 104 - 119Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , , and , On the strength of Ramsey's theorem for pairs,The Journal of Symbolic Logic, vol. 66 (2001), no. 1, pp. 1–55.
[2] , Some weak versions of large cardinal axioms,Annals of Mathematical Logic, vol. 5 (1972–1973), pp. 291–325.
[3] and , More on the free subset problem,Annals ofMathematical Logic, vol. 5 (1972–1973), pp. 327–336.
[4] , Narrow coverings of ω-ary product spaces,Annals of Pure and Applied Logic, vol. 88 (1997), no. 1, pp. 47–91.
[5] , private communication.
[6] , Fom:53:Free sets and reverse math and Fom:54:Recursion theory and dynamics, at http://www.math.psu.edu/simpson/fom/.
[7] and , Issues and problems in reversemathematics,Computability theory and its applications (Boulder, CO, 1999), Contemp.Math., vol. 257, Amer. Math. Soc., Providence, RI, 2000, pp. 127–144.
[8] , Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, 1987.
[9] and , Jr., Ramsey's theorem for computably enumerable colorings,The Journal of Symbolic Logic, vol. 66 (2001), no. 2, pp. 873–880.
[10] , Jr., Ramsey's theorem and recursion theory,The Journal of Symbolic Logic, vol. 37 (1972), pp. 268–280.
[11] , Upward closure and cohesive degrees,Israel Journal of Mathematics, vol. 15 (1973), pp. 332–335.
[12] , Algebraic independence,The Journal of Symbolic Logic, vol. 46 (1981), no. 2, pp. 377–384.
[13] , Ramsey's theorem with sums or unions,Journal of Combinatorial Theory. Series A, vol. 18 (1975), pp. 276–290.
[14] and , On the strength of Ramsey's theorem,Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582, Special Issue: Models of arithmetic.
[15] , Subsystems of second order arithmetic, Perspectives inMathematical Logic, Springer-Verlag, Berlin, 1999.
- 1
- Cited by