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
Higher order reversemathematics
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. 281 - 295Publisher: Cambridge University PressPrint publication year: 2005
References
[1] and , Gödel's functional (‘Dialectica’) interpretation, [3], 1998, pp. 337–405.
[2] , Foundations of constructive mathematics, Springer Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge, Bd. 6., Berlin Heidelberg, New York, Tokyo, 1985.
[3] (editor), Handbook of proof theory, Studies in Logic and the Foundations of Mathematics, vol. 137, Elsevier, 1998.
[4] , Theories of finite type related to mathematical practice,Handbook of mathematical logic (, editor), North-Holland, Amsterdam, 1977, pp. 913–972.
[5] , Models of ZF–set theory, Lecture Notes in Mathematics, vol. 223, Springer, Berlin, 1971.
[6] , Systems of second order arithmetic with restricted induction (abstract),The Journal of Symbolic Logic, vol. 41 (1976), pp. 558–559.
[7] , Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes,Dialectica, vol. 12 (1958), pp. 280–287.
[8] , On effectively discontinuous type-2 objects,The Journal of Symbolic Logic, vol. 36 (1971), pp. 245–248.
[9] , Recursive functionals and quantifiers of finite types I,Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1–52.
[10] , Effective moduli from ineffective uniqueness proofs. an unwinding of de la Vallee Poussin's proof for Chebycheff approximation,Annals of Pure and Applied Logic, vol. 64 (1993), pp. 27–94.
[11] , Proof theory and computational analysis, Electronic Notes in Theoretical Computer Science, vol. 13, Elsevier, 1998. [12],Things that can and things that can't be done in PRA,Annals of Pure and Applied Logic, vol. 102 (2000), pp. 223–245.
[13] , Foundational and mathematical uses of higher types,Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, Lecture Notes in Logic, vol. 15, A.K. Peters, 2002, pp. 92–116.
[14] , On uniform weak König's lemma,Annals of Pure and Applied Logic, vol. 114 (2002), pp. 103–116.
[15] and , Fixed point theory in weak second-order arithmetic,Annals of Pure and Applied Logic, vol. 47 (1990), pp. 167–188.
[16] , Subsystems of second order arithmetic, Perspectives inMathematical Logic, Springer-Verlag, 1999.
[17] (editor), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer, 1973.
[18] , Note on the fan theorem,The Journal of Symbolic Logic, vol. 39 (1974), pp. 584– 596.
[19] and , Constructivism in mathematics, vol. II, Noth-Holland, 1988.
[20] , Computable analysis, Springer, Berlin, 2000.
- 35
- Cited by