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
Models of arithmetic: quantifiers and complexity
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. 271 - 280Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Solovay's theorem cannot be simplified,Annals of Pure and Applied Logic, vol. 112 (2001), pp. 27–41.
[2] , Possible degrees of n-diagrams,Reverse mathematics 2001 (, editor), Lecture Notes in Logic, vol. 22, , 2005, this volume, pp. 1–18.Google Scholar
[3] and , Computable structures and the hyperarithmetical hierarchy, Elsevier, 2000.
[4] , Back-and-forth through infinitary logic,Studies in model theory (, editor),M.A.A., 1973.
[5] , Degrees coded in jumps of orderings,The Journal of Symbolic Logic, (1986), pp. 1034–1042.
[6] , True approximations and models of arithmetic,Models and computability ( and , editors), Cambridge University Press, 1999.
[7] , Minimality questions and completions of PA,The Journal of Symbolic Logic, vol. 66 (2001), pp. 1447–1457.
[8] , Sequences of degrees associated with models of arithmetic,Logic colloquium '01 (, , and , editors), Lecture Notes in Logic, vol. 20, AK Peters, 2005, pp. 217–241.
[9] , Degrees of models of true arithmetic,Proc. of theHerbrand symposium (, editor), North-Holland, 1981.
[10] , Algebras of sets binumerable in complete extensions of arithmetic,Recursive function theory (, editor), AmericanMathematical Society, 1962.
[11] , Non-archimedean models for arithmetic,Notices of the AmericanMathematical Society, (1959), p. 270.