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
Reverse mathematics and weak systems of 0-1 strings for feasible analysis
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. 394 - 401Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Polynomial time computable arithmetic and conservative extensions, Ph.D. thesis, Pennsylvania State University at University Park, 1988.
[2] , Polynomial time computable arithmetic,Contemporary Mathematics, vol. 106 (1990), pp. 137–156.
[3] , A feasible theory for analysis,The Journal of Symbolic Logic, vol. 59 (1994), no. 3, pp. 1001–1011.
[4] , Some notes on subword quantification and induction thereof,Logic and algebra (Pontignano, 1994), Lecture Notes in Pure and Appl. Math., 180, Dekker, New York, 1996, pp. 477–489.
[5] and , Basic applications of weak König's lemma in feasible analysis,Reverse mathematics 2001 (, editor), Lecture Notes in Logic, vol. 22, AK Peters, 2005, this volume, pp. 175–188.
[6] , The computational complexity of maximization and integration,Advances in Mathematics, vol. 53 (1984), pp. 80–89.
[7] , Subsystems of Second OrderArithmetic, Perspectives inMathematical Logic, Springer-Verlag, 1999.
[8] and , Factorization of polynomials and Σ01 induction,Annals of Pure and Applied Logic, (1986), no. 31, pp. 289–306.
- 2
- Cited by