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
Interpreting arithmetic in the r.e. degrees under Σ4-induction
Published online by Cambridge University Press: 31 March 2017
Edited by
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. 120 - 146Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , , Jr., , and , An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees,Transactions of the American Mathematical Society, vol. 281 (1984), pp. 109–128.
[2] , , , and , Σ2 induction and infinite injury priority arguments, part III: Prompt sets, minimal pairs and Shoenfield's conjecture, To appear in Israel Journal of Mathematics.
[3] and , Recursion theory in weak fragments of Peano arithmetic: A study of cuts,Proc. Sixth Asian Logic Conference, Beijing 1996, World Scientific, Singapore, 1998, pp. 47–65.
[4] and , Computability theory in arithmetic: Provability, structure and techniques,Computability Theory and Its Applications: Current Trends and Open Problems (, and , editors), Comtemporary Mathematics, vol. 257, AMS, Providence RI, 2000, pp. 73–82.
[5] , Model theory, Cambridge University Press, Cambridge, 1993.
[6] , , and , Splitting properties and jump classes,Israel Journal of Mathematics, vol. 39 (1981), pp. 210–224.
[7] , Recursion theoretic statements equivalent to induction axioms for arithmetic, Ph.D. thesis, University of Chicago, 1988.
[8] , , and , Definability in the recursively enumerable degrees,The Bulletin of Symbolic Logic, vol. 2 (1996), no. 4, pp. 392–404.
[9] , , Interpretability and definability in the recursively enumerable degrees,Proceedings of the London Mathematical Society. Third Series, vol. 77 (1998), no. 2, pp. 241–291.
[10] , The theory of the degrees below 0,The Journal of the London Mathematical Society. Second Series, vol. 24 (1981), pp. 1–14.
[11] , Constructing recursively enumerable sets, Lecture notes (unpublished), Nanjing, May, 1985.
[12] , Subsystems of second order arithmetic, Springer-Verlag, Berlin, 1999.
[13] , Recursively enumerable sets and degrees, Springer-Verlag, Heidelberg, 1987.
[14] , Σ3 induction and 0 priority arguments, in preparation.
- 1
- Cited by