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
Π01 sets and models of WKL0
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. 352 - 378Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Computable Analysis, McGraw-Hill, 1980.
[2] (editor), Handbook of Mathematical Logic, Studies in Logic and the Foundations of Mathematics, North-Holland, 1977.
[3] and , Π0/1 classes in mathematics, [7], 1998, pp. 623–821.
[4] , , and (editors), Computability, Enumerability, Unsolvability: Directions in Recursion Theory, London Mathematical Society Lecture Notes, no. 224, Cambridge University Press, 1996.
[5] (editor), Recursive Function Theory, Proceedings of Symposia in Pure Mathematics, AmericanMathematical Society, 1962.
[6] and (editors), Logic Colloquium '86, Studies in Logic and the Foundations of Mathematics, North-Holland, 1988.
[7] , , , and (editors), Handbook of Recursive Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, 1998.
[8] , , and (editors), Logic, Methodology and Philosophy of Science VIII, Studies in Logic and the Foundations of Mathematics, Elsevier, 1989.
[9] , , and (editors)FOM e-mail list, http://www.cs.nyu.edu/mailman/listinfo/fom/, September 1997 to the present.
[10] , Subsystems of second order arithmetic and their use in the formalization of mathematics, 19 pages, unpublished, March 1974.
[11] , Some systems of second order arithmetic and their use,Proceedings of the International Congress of Mathematicians, Vancouver 1974, vol. 1, Canadian Mathematical Congress, 1975, pp. 235–242.
[12] , Collected Works, Oxford University Press, 1986–1995.
[13] , , , and (editors), Harvey Friedman 's Research on the Foundations of Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, 1985.
[14] , Set Theory, Pure and Applied Mathematics, Academic Press, New York, 1978.
[15] , Jr., Degrees of functions with no fixed points, [8], 1989, pp. 191–201.
[16] , Jr. and , Π0/1 classes and degrees of theories,Transactions of the American Mathematical Society, vol. 173 (1972), pp. 35–56.
[17] , Models of Peano Arithmetic, Oxford University Press, 1991.
[18] , On the role of 0 in recursion theory, [6], 1988, pp. 133–141.
[19] , Set Theory, an Introduction to Independence Proofs, Studies in Logic and the Foundations of Mathematics, North-Holland, 1980.
[20] , Creative sets,Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 97–108.
[21] , Finite injury and Σ1 induction,The Journal of Symbolic Logic, vol. 54 (1989), pp. 38–49.
[22] and , Deduction-preserving “recursive isomorphisms” between theories,Fundamenta Mathematicae, vol. 61 (1967), pp. 141–163.
[23] and , Computability in Analysis and Physics, Perspectives inMathematical Logic, Springer-Verlag, 1988.
[24] , Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
[25] , Algebras of sets binumerable in complete extensions of arithmetic, [5], 1962, pp. 117–121.
[26] and , On the degrees of complete extensions of arithmetic (abstract), Notices of the American Mathematical Society, vol. 7 (1960), pp. 242–243.
[27] , Degrees of unsolvability: a survey of results, [2], 1977, pp. 631–652.
[29] , FOM: priority arguments; Kleene-r.e. degrees; Pi01 classes, FOM e-mail list [9], August 16, 1999.Google Scholar
[30] , Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, 1999.
[31] , , and , Some conservation results on weak König's lemma,Annals of Pure and Applied Logic, vol. 118 (2002), pp. 87–114.
[32] , Theory of Formal Systems, Annals of Mathematics Studies, Princeton University Press, 1961.
[33] , Recursively Enumerable Sets and Degrees, Perspectives inMathematical Logic, Springer-Verlag, 1987.
[34] , The Medvedev lattice of degrees of difficulty, [4], 1996, pp. 289–312.
[35] , More on models of WKL0 (see also [36]), 4 pages, handwritten, 1995.
[36] , (in Japanese), Sūrikaisekikenkyūsho Kōkyūroku, vol. 976 (1997), pp. 77–85.
[37] (editor), From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931, Harvard University Press, 1967.
- 7
- Cited by