On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
From MaRDI portal
Publication:3295145
DOI10.1007/978-3-030-30229-0_2zbMath1481.03046arXiv1711.00428OpenAlexW2893252084MaRDI QIDQ3295145
Mirna Dzamonja, Sylvain Schmitz, Philippe Schnoebelen
Publication date: 8 July 2020
Published in: Trends in Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.00428
Partial orders, general (06A06) Other combinatorial set theory (03E05) Ordinal and cardinal numbers (03E10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Obstacles to extending Mirsky's theorem
- A note on Dilworth's theorem in the infinite case
- The relation between the height of a well-founded partial ordering and the order types of its chains and antichains
- Proof-theoretic investigations on Kruskal's theorem
- Well-partial-orderings and the big Veblen number
- The theory of well-quasi-ordering: a frequently discovered concept
- On Dilworth's theorem in the infinite case
- A decomposition theorem for partially ordered sets
- A scattering of orders
- Multiply-Recursive Upper Bounds with Higman’s Lemma
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
- On Chains and Antichains in well Founded Partially Ordered Sets
- Well-quasi-orderings and sets of finite sequences
- Program termination and well partial orderings
- Partially well ordered sets and partial ordinals
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- A Dual of Dilworth's Decomposition Theorem
- Partially Ordered Sets
- Ordering by Divisibility in Abstract Algebras
- Partial well‐ordering of sets of vectors