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
Possible m-diagrams ofmodels of arithmetic
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. 1 - 18Publisher: 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.Google Scholar
[2] (editor), Handbook of mathematical logic, Studies in Logic and the Foundations ofMathematics, vol. 90, North-Holland Publishing Co., Amsterdam, 1977.
[3] , Arithmetically definable models of formalizable arithmetic, Notices of the American Mathematical Society, vol. 5 (1958), p. 679.Google Scholar
[4] KurtGödel, Über formal unentscheidhare Sätze der PrincipiaMathematica und verwandter Systeme I,Collected works (Solomon Feferman et al., editors), vol. 1, Oxford University Press, New York and Oxford, 1986, pp. 145–195.
[5] , Building non-standard models of Peano Arithmetic, Unpublished notes, 1979.
[6] , True approximations and models of arithmetic, Models and computability ( and , editors), Cambridge University Press, New York, 1999, pp. 255–278.
[7] and , Degrees of recursively saturated models,Transactions of the American Mathematical Society, vol. 282 (1984), pp. 539–554.
[8] , Degrees of models of true arithmetic,Proceedings of the Herbrand Symposium (, editor), North-Holland, 1982, pp. 233–242.
[9] , Degrees of models of arithmetic, Ph.D. thesis, Yale University, 1983.
[10] , Enumerable sets are Diophantine,Doklady Akademii Nauka SSSR, vol. 191 (1970), pp. 272–282, Russian.
[11] , Extensions of some theorems of Gödel and Church,The Journal of Symbolic Logic, vol. 1 (1936), pp. 87–91.
[12] , Algebras of sets binumerable in complete extensions of arithmetic,Recursive function theory(, editor), Proceedings of Symposia in Pure Mathematics, vol. V, American Mathematical Society, 1962, pp. 117–122.Google Scholar
[13] , Degrees of unsolvability: A survey of results, [2], pp. 631–652.
[14] , Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer, 1999.
[15] , Degrees of models of true arithmetic, Circulated preprint, 1982.