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
WQO and BQO theory in subsystems of second order arithmetic
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. 303 - 330Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , , Jr., and , On the strength of Ramsey's theorem for pairs,The Journal of Symbolic Logic, vol. 66 (2001), pp. 1–55.
[2] , , and , Reverse mathematics and the equivalence of definitions for well and better quasi-orders,The Journal of Symbolic Logic, vol. 69 (2004), no. 3, pp. 683–712.
[3] , A recursion theoretic analysis of the clopen Ramsey theorem,The Journal of Symbolic Logic, vol. 49 (1984), no. 2, pp. 376–400.
[4] , The metamathematics of scattered linear orderings,Archive for Mathematical Logic, vol. 29 (1989), no. 1, pp. 9–20.
[5] , The metamathematics of Fraïssé's order type conjecture,Recursion theory week (, , and , editors), Springer-Verlag, Berlin, 1990, pp. 41–56.
[6] , , and , Rigid Borel sets and better quasi-order theory, In Simpson [41], pp. 199–222.
[7] , Sur la comparaison des types d'ordres,Comptes Rendus Mathèmatique. Académie des Sciences. Paris., vol. 226 (1948), pp. 1330–1331.
[8] , Enormous integers, manuscript, 11pp., 1999.
[9] and , Weak comparability of well orderings and reverse mathematics,Annals of Pure and Applied Logic, vol. 47 (1990), no. 1, pp. 11–29.
[10] , , and , The metamathematics of the graph minor theorem, In Simpson [41], pp. 229–261.
[11] and , Issues and problems in reverse mathematics,Computability theory and its applications (Boulder, CO, 1999) (, , , and , editors), Amer. Math. Soc., Providence, RI, 2000, pp. 127–144.
[12] , Proof theory and logical complexity, Bibliopolis, Naples, 1987.
[13] , Ordering by divisibility in abstract algebras,Proceedings of the London Mathematical Society. Third Series., vol. 2 (1952), pp. 326–336.
[14] , Combinatorics in subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, 1987.
[15] , Reverse mathematics and ordinal exponentiation,Annals of Pure and Applied Logic, vol. 66 (1994), no. 1, pp. 1–18.
[16] and , Well-partial orderings and hierarchies, Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, Series A 80 = Indagationes Mathematicae, vol. 39 (1977), no. 3, pp. 195–207.
[17] and , Ordinal types in Ramsey theory and well-partial-ordering theory,Mathematics of Ramsey theory ( and , editors), Springer-Verlag, Berlin, 1990, pp. 57–95.
[18] , Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture,Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210–225.
[19] , The theory of well-quasi-ordering: a frequently discovered concept,Journal of Combinatorial Theory. Series A, vol. 13 (1972), pp. 297–305.
[20] , On Fraïssé's order type conjecture,Annals ofMathematics. Second Series, vol. 93 (1971), pp. 89–111.
[21] , Well-quasi-orderings and sets of finite sequences, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 79 (1976), no. 1, pp. 1–10.
[22] , Better-quasi-orderings and a class of trees,Studies in foundations and combinatorics (, editor), Academic Press, New York, 1978, pp. 31–48.
[23] and , Recursive aspects of descriptive set theory, Oxford University Press, New York, 1985, with a chapter by .
[24] , Foundations of BQO theory,Transactions of the American Mathematical Society, vol. 345 (1994), no. 2, pp. 641–660.
[25] , The set of better quasi orderings is Π1/2-complete,Mathematical Logic Quarterly, vol. 41 (1995), no. 3, pp. 373–383.
[26] , On the logical strength of Nash-Williams' theorem on transfinite sequences,Logic: from foundations to applications (, , , and , editors), The Clarendon Press, New York, 1996, pp. 327–351.
[27] , Fine analysis of the quasi-orderings on the power set,Order. A Journal on the Theory of Ordered Sets and its Applications, vol. 18 (2001), pp. 339–347.
[28] , Basic wqo- and bqo-theory,Graphs and order (Ivan Rival, editor), D. Reidel, Dordrecht, 1985, pp. 487–502.
[29] , On well-quasi-ordering finite trees, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 59 (1963), pp. 833–835.
[30] , On well-quasi-ordering infinite trees, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 61 (1965), pp. 697–720.
[31] , On better-quasi-ordering transfinite sequences,Mathematical Proceedings of the Cambridge Philosophical Society, vol. 64 (1968), pp. 273–290.
[32] and , From wqo to bqo, via Ellentuck's theorem,DiscreteMathematics, vol. 108 (1992), no. 1-3, pp. 83–106.
[33] , Partial well-ordering of sets of vectors,Mathematika. A Journal of Pure and Applied Mathematics, vol. 1 (1954), pp. 89–95.
[34] and , Proof-theoretic investigations on Kruskal's theorem,Annals of Pure and Applied Logic, vol. 60 (1993), no. 1, pp. 49–88.
[35] , Well-partial orderings and their maximal order types, Habilitationschrift, Heidelberg University, 1979.
[36] and , Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen,Archiv für Mathematische Logik und Grundlagenforschung, vol. 25 (1985), no. 1-2, pp. 75–89.
[37] and , On the strength of Ramsey's theorem,Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582.
[38] , On the strength of Fraïssé's conjecture,Logical methods (, , , and , editors), Birkhäuser, Boston, MA, 1993, pp. 782–813.
[39] , Bqo-theory and Fraïssé's conjecture, Chapter 9 of [23].
[40] , Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman 's research on the foundations of mathematics (, , , and , editors), North-Holland, Amsterdam, 1985, pp. 87–117.
[41] (editor), Logic and combinatorics, American Mathematical Society, Providence, R.I., 1987.
[42] , Ordinal numbers and the Hilbert basis theorem,The Journal of Symbolic Logic, vol. 53 (1988), no. 3, pp. 961–974.
[43] , Subsystems of second order arithmetic, Springer-Verlag, Berlin, 1999.
[44] , On better-quasi-ordering countable series-parallel orders, Transactions of the American Mathematical Society, vol. 352 (2000), no. 6, pp. 2491–2505.
[45] Carsten Thomassen, Embeddings and minors,Handbook of combinatorics, vol. 1 (, , and , editors), Elsevier Science, Amsterdam, 1995, pp. 301–349.
- 7
- Cited by