On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders

We investigate the ordinal invariants height, length, and width of well quasi orders (WQO), with particular emphasis on width, an invariant of interest for the larger class of orders with finite antichain condition (FAC). We show that the width in the class of FAC orders is completely determined by the width in the class of WQOs, in the sense that if we know how to calculate the width of any WQO then we have a procedure to calculate the width of any given FAC order. We show how the width of WQO orders obtained via some classical constructions can sometimes be computed in a compositional way. In particular this allows proving that every ordinal can be obtained as the width of some WQO poset. One of the difficult questions is to give a complete formula for the width of Cartesian products of WQOs. Even the width of the product of two ordinals is only known through a complex recursive formula. Although we have not given a complete answer to this question we have advanced the state of knowledge by considering some more complex special cases and in particular by calculating the width of certain products containing three factors. In the course of writing the paper we have discovered that some of the relevant literature was written on cross-purposes and some of the notions re-discovered several times. Therefore we also use the occasion to give a unified presentation of the known results.

[1]  Michael Rathjen,et al.  Well-partial-orderings and the big Veblen number , 2015, Arch. Math. Log..

[2]  Diana Schmidt.  The relation between the height of a well-founded partial ordering and the order types of its chains and antichains , 1981, J. Comb. Theory, Ser. B.

[3]  Joseph B. Kruskal,et al.  The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[4]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[5]  Andreas Blass,et al.  Program termination and well partial orderings , 2008, TOCL.

[6]  Micha A. Perles.  A proof of dilworth’s decomposition theorem for partially ordered sets , 1963 .

[7]  E. S. Wolk.  Partially well ordered sets and partial ordinals , 1967 .

[8]  James H. Schmerl.  Obstacles to Extending Mirsky's Theorem , 2002, Order.

[9]  E. C. Milner.  Basic WQO- and BQO-Theory , 1985 .

[10]  Richard Laver,et al.  Mathematical Proceedings of the Cambridge Philosophical Society Well -quasi -orderings and sets of finite sequences , 2007 .

[11]  E. C. Milner,et al.  On Chains and Antichains in well Founded Partially Ordered Sets , 1981 .

[12]  Philippe Schnoebelen,et al.  Multiply-Recursive Upper Bounds with Higman's Lemma , 2011, ICALP.

[13]  Douglas B. West,et al.  Extremal Problems in Partially Ordered Sets , 1982 .

[14]  Uri Abraham,et al.  A note on Dilworth's theorem in the infinite case , 1987 .

[15]  Diana Schmidt,et al.  Well-Partial Orderings and their Maximal Order Types , 2020 .

[16]  Igor Kříž,et al.  Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory , 1990 .

[17]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[18]  Dick H. J. Jongh,et al.  Well-partial orderings and hierarchies , 1977 .

[19]  R. Rado.  Partial well-ordering of sets of vectors , 1954 .

[20]  L. Mirsky.  A Dual of Dilworth's Decomposition Theorem , 1971 .

[21]  Uri Abraham,et al.  A scattering of orders , 2012 .

[22]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[23]  Andreas Weiermann,et al.  A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets , 2009, CiE.

[24]  Micha A. Peles.  On dilworth’s theorem in the in finite case , 1963 .

[25]  Michael Rathjen,et al.  Proof-Theoretic Investigations on Kruskal's Theorem , 1993, Ann. Pure Appl. Log..

[26]  Jeroen Van der Meeren,et al.  Connecting the two worlds: well-partial-orders and ordinal notation systems , 2015 .

[27]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[28]  Uri Abraham,et al.  Hausdorff ’s theorem for posets that satisfy the finite antichain property , 1999 .