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
Metamathematics of comparability
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. 201 - 218Publisher: Cambridge University PressPrint publication year: 2005
References
[1] and , The completeness of the isomorphismrelation for countable Boolean algebras,Transactions of the AmericanMathematical Society, vol. 353 (2001), no. 2, pp. 491–518.
[2] and , Weak comparability of well orderings and reverse mathematics,Annals of Pure and Applied Logic, vol. 47 (1990), pp. 11–29.
[3] and , Reverse mathematics of homeomorphic embeddings,Annals of Pure and Applied Logic, vol. 54 (1991), pp. 229–253.
[4] , Proof theory and logical complexity, Bibliopolis, Naples, 1987.
[5] , Embeddings of countable closed sets and reverse mathematics,Archive for Mathematical Logic, vol. 32 (1992), pp. 183–192.
[6] , A note on compactness of countable sets,Reverse mathematics 2001 (, editor), Lecture Notes in Logic, vol. 22, , 2005, this volume, pp. 219–221.Google Scholar
[7] , Countable Boolean algebras,Handbook of Boolean algebras ( and , editors), Elsevier, 1989, pp. 775–876.
[8] , Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer, 1999.
- 1
- Cited by