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
Arithmetic saturation
Published online by Cambridge University Press: 31 March 2017
By
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. 296 - 302Publisher: Cambridge University PressPrint publication year: 2005
References
[1] and , On interstices of countable arithmetically saturated models of Peano arithmetic,Mathematical Logic Quarterly, vol. 43 (1997), no. 4, pp. 525– 540.
[2] , , and , On regular interstices and selective types in countable arithmetically saturated models of Peano arithmetic,Fundamenta Mathematicae, vol. 158 (1998), no. 2, pp. 125–146.
[3] , , and , Logical analysis of some theorems of combinatorics and topological dynamics,Logic and combinatorics (Arcata, Calif., 1985), Amer.Math. Soc., Providence, RI, 1987, pp. 125–156.
[4] and , Metamathematics of first-order arithmetic, Springer-Verlag, Berlin, 1998, Second printing.
[5] and , Some problem in elementary arithmetics,Fundamenta Mathematicae, vol. 92 (1976), no. 3, pp. 223–245.
[6] , Models of Peano arithmetic, The Clarendon PressOxford University Press, New York, 1991, Oxford Science Publications.
[7] and , Initial segments of models of Peano's axioms,Set theory and hierarchy theory, V (Proc. Third Conf., Bierutowice, 1976), Lecture Notes in Math., vol. 619, Springer, Berlin, 1977, pp. 211–226.
[8] , Automorphisms moving all non-algebraic points and an application to NF,The Journal of Symbolic Logic, vol. 63 (1998), no. 3, pp. 815–830.
[9] , Automorphisms of recursively saturated models of Peano arithmetic: fixed point sets,Logic Journal of the Interest Group in Pure and Applied Logics, vol. 5 (1997), no. 6, pp. 787–794 (electronic).
[10] and , Arithmetically saturated models of arithmetic,Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 531–546, Special Issue: Models of arithmetic.
[11] and , The automorphism group of an arithmetically saturated model of Peano arithmetic,Journal of the London Mathematical Society. Second Series, vol. 52 (1995), no. 2, pp. 235–244.
[12] , The small index property and recursively saturated models of Peano arithmetic,Automorphisms of first-order structures, Oxford Univ. Press, New York, 1994, pp. 281– 292.
[13] , Generic automorphisms and graph coloring, to appear.
[14] , Subsystems of second order arithmetic, Springer-Verlag, Berlin, 1999.