• Corpus ID: 117681108

On the logical strength of Nash-Williams' theorem on transfinite sequences

  title={On the logical strength of Nash-Williams' theorem on transfinite sequences},
  author={Alberto Marcone},
  journal={arXiv: Logic},
We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic Pi^1_1-CA_0 but is not equivalent to Pi^1_1-CA_0. We obtain some partial results towards the proof of this theorem in the weaker subsystem ATR_0 and we show that the minimality lemmas typical of wqo and bqo theory imply Pi^1_1-CA_0 and hence cannot be used in… 
Higman's lemma is stronger for better quasi orders
. We prove that Higman’s lemma is strictly stronger for better quasi orders than for well quasi orders, within the framework of reverse mathematics. In fact, we show a stronger result: the infinite
An order-theoretic characterization of the Howard–Bachmann-hierarchy
In this article we provide an intrinsic characterization of the famous Howard–Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal
The computational strength of matchings in countable graphs
Partial impredicativity in reverse mathematics
  • H. Towsner
  • Mathematics
    The Journal of Symbolic Logic
  • 2013
Using methods based on the functional interpretation, a family of weakenings of and use them to give new upper bounds for the Nash-Williams Theorem of wqo theory and Menger's Theorem for countable graphs are introduced.
Well-Quasi Orders in Computation, Logic, Language and Reasoning
The rôle played by the ideals of a wqo in its bqoness is recalled and a new presentation of known examples of wqos which fail to be bqo is given.
Unprovability in Mathematics: A First Course on Ordinal Analysis
. These are the lecture notes of an introductory course on ordinal analysis. Our selection of topics is guided by the aim to give a complete and direct proof of a mathematical independence result:
Proof theory of graph minors and tree embeddings
This thesis establishes a narrow corridor for the possible proof-theoretic strength of many strong combinatorial principles, including the graph minor theorem, immersion theorem, theorems about patchwork containment, and various restrictions, extensions and labelled versions of these theorem.
(Extra)ordinary equivalences with the ascending/descending sequence principle
We analyze the axiomatic strength of the following theorem due to Rival and Sands [28] in the style of reverse mathematics. Every infinite partial order P of finite width contains an infinite chain C
Formalizing Ordinal Partition Relations Using Isabelle/HOL
An overview of a formalization project in the proof assistant Isabelle/HOL of a number of research results in infinitary combinatorics and set theory by Erdős–Milner, Specker, Larson and Nash-Williams, leading to Larson's proof of the unpublished result by E.C. Milner asserting that for all.
An Introduction to WQO and BQO Theory (Preliminary Version)
First present totality proofs that rely on compactness. Then show that some of these results can be proved directly by induction on long wellorderings. Finally try to extract some converses. The


On the Strength of König's Duality Theorem for Countable Bipartite Graphs
It is shown that CKDT is logically equivalent to the axioms of ATR0, the equivalence being provable in RCA0.
Foundations of BQO theory
In this paper we study the notion of better-quasi-ordering (bqo) originally defined by Nash-Williams [14]. In particular we consider the approximation to this concept given by the notion of a -wqo,
Weak Comparability of Well Orderings and Reverse Mathematics
A recursion theoretic analysis of the clopen Ramsey theorem
  • P. Clote
  • Mathematics
    Journal of Symbolic Logic
  • 1984
A finer recursion theoretic analysis of the clopen Ramsey theorem is presented, correlating the "order type" of a clopen partition and the Turing degrees of the infinite sets homogeneous for the partition.
The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept
On well-quasi-ordering transfinite sequences
  • C. Nash-Williams
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1965
Abstract . Let Q be a well-quasi-ordered set, i.e. a set on which a reflexive and transitive relation ≤ is defined and such that, for every infinite sequence q1,q2,… of elements of Q, there exist i
Reverse Mathematics and Ordinal Exponentiation
  • J. Hirst
  • Mathematics
    Ann. Pure Appl. Log.
  • 1994
On better-quasi-ordering transfinite sequences
  • C. Nash-Williams
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1968
Abstract Let Q be a quasi-ordered set, i.e. a set on which a reflexive and transitive relation ≤ is defined. If, for every finite sequence q1, q2, … of elements of Q, there exist i and j such that i
The aim of this lecture is to survey some of the striking applications of the theory of well quasi-order (wqo) and better quasi-order (bqo) and to illustrate with examples how one can use this theory