Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2005)
Ordered sets, volume 7 of Advances in Mathematics (Springer)
(2001)
A SURVEY OF THE REVERSE MATHEMATICS OF ORDINAL ARITHMETIC
(1992)
Papers from the conference in honor of Anil Nerode's sixtieth birthday
C. Thomassen (1995)
Handbook of Combinatorics, vol. 1.
N. Robertson, P. Seymour (1996)
Graph Minors: XV. Giant StepsJ. Comb. Theory, Ser. B, 68
S.G. Simpson (2009)
Subsystems of Second Order Arithmetic, Perspectives in Logic
(2005)
Ordered sets, volume 7 of Advances in Mathematics
Italy E-mail address: alberto.marcone@dimi.uniud.it Department of Mathematics
A. Marcone (2003)
WQO AND BQO THEORY IN SUBSYSTEMS OF SECOND ORDER ARITHMETIC
J. Hirst (1994)
Reverse Mathematics and Ordinal ExponentiationAnn. Pure Appl. Log., 66
J. Kruskal (1972)
The Theory of Well-Quasi-Ordering: A Frequently Discovered ConceptJ. Comb. Theory, Ser. A, 13
L. Lovász, M. Grötschel, R. Graham (1995)
Handbook of Combinatorics
S. Simpson (1988)
Ordinal numbers and the Hilbert basis theoremJournal of Symbolic Logic, 53
J. Kruskal (1960)
Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjectureTransactions of the American Mathematical Society, 95
R. Shore (1993)
On the strength of Fraïssé’s conjecture
J. Girard (1989)
Proof Theory and Logical ComplexityAnnals of Pure and Applied Logic, 53
S. Simpson (1985)
Nonprovability of Certain Combinatorial Properties of Finite TreesStudies in logic and the foundations of mathematics, 117
I. Kríz, R. Thomas (1990)
Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory, 29
Peter Cholak, C. Jockusch, T. Slaman (2001)
On the strength of Ramsey's theorem for pairsJournal of Symbolic Logic, 66
(2005)
Reverse mathematics 2001, volume 21 of Lecture Notes in Logic
C.St.J.A. Nash-Williams (1968)
On better-quasi-ordering transfinite sequencesProc. Camb. Philos. Soc., 64
E. Milner, N. Sauer (1981)
On Chains and Antichains in well Founded Partially Ordered SetsJournal of The London Mathematical Society-second Series
C.St.J.A. Nash-Williams (1965)
On well-quasi-ordering transfinite sequencesProc. Camb. Philos. Soc., 61
A. Marcone, A. Montalbán (2009)
On Fraïssé's conjecture for linear orders of finite Hausdorff rankAnn. Pure Appl. Log., 160
S. Simpson (1999)
Subsystems of second order arithmetic
D. Schmidt (1981)
The relation between the height of a well-founded partial ordering and the order types of its chains and antichainsJ. Comb. Theory, Ser. B, 31
D. Hirschfeldt, R. Shore (2007)
Combinatorial principles weaker than Ramsey's Theorem for pairsJournal of Symbolic Logic, 72
(2005)
Reverse mathematics 2001, volume 21 of Lecture Notes in Logic. Association for Symbolic
E. Wolk (1967)
Partially well ordered sets and partial ordinalsFundamenta Mathematicae, 60
C. Thomassen (1996)
Embeddings and minors
H. Friedman, J. Hirst (1990)
Weak Comparability of Well Orderings and Reverse MathematicsAnn. Pure Appl. Log., 47
Dick Jongh, R. Parikh (1977)
Well-partial orderings and hierarchies, 80
Matemáticas (2013)
Theory of Relations
Peter Cholak, A. Marcone, Reed Solomon (2004)
Reverse mathematics and the equivalence of definitions for well and better quasi-ordersJournal of Symbolic Logic, 69
Peter Cholak (1999)
Review: Stephen G. Simpson, Subsystems of Second Order ArithmeticJournal of Symbolic Logic, 64
D. Schmidt (1979)
Well-Partial Orderings and Their Maximal Order Types
G. Higman (1952)
Ordering by Divisibility in Abstract AlgebrasProceedings of The London Mathematical Society
R. Laver (1971)
On Fraisse's order type conjectureAnnals of Mathematics, 93
H. Friedman, L. Harrington (1985)
Harvey Friedman's Research on the Foundations of Mathematics
C. Nash-Williams (1965)
On well-quasi-ordering transfinite sequencesMathematical Proceedings of the Cambridge Philosophical Society, 61
Harvey Friedman, Neil Robertson, P. Seymour (1985)
The metamathematics of the graph minor theorem
(1992)
On the strength of Fra¨Fra¨ıssé's conjecture Papers from the conference in honor of Anil Nerode's sixtieth birthday held at Cornell University
A. Montalbán (2007)
Computable Linearizations of Well-partial-orderingsOrder, 24
A. Blass, Y. Gurevich (2008)
Program termination and well partial orderingsACM Trans. Comput. Log., 9
N. Robertson, P. Seymour (2004)
Graph Minors. XX. Wagner's conjectureJ. Comb. Theory, Ser. B, 92
C. Nash-Williams (1968)
On better-quasi-ordering transfinite sequencesMathematical Proceedings of the Cambridge Philosophical Society, 64
E. Harzheim (2005)
Ordered Sets. Advances in Mathematics (Springer), vol. 7
We show that the maximal linear extension theorem for well partial orders is equivalent over RCA 0 to ATR 0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR 0 over RCA 0.
Archive for Mathematical Logic – Springer Journals
Published: Mar 20, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.