Well-partial-orderings and the big Veblen number
From MaRDI portal
Publication:2257112
DOI10.1007/s00153-014-0408-5zbMath1378.03041OpenAlexW1988230691WikidataQ59898616 ScholiaQ59898616MaRDI QIDQ2257112
Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
Publication date: 23 February 2015
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/81601/1/Well-partial-orderings%20and%20the%20big%20Veblen%20number.pdf
Kruskal's theoremcollapsing functionmaximal order typenatural well-orderingsordinal notation systemsrecursively defined treestree-embeddabilitieswell-partial-orderingsbig Veblen number
Partial orders, general (06A06) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10)
Related Items
Minimal bad sequences are necessary for a uniform Kruskal theorem, How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems, Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition, Bachmann-Howard derivatives, Unnamed Item, On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders, An order-theoretic characterization of the Howard-Bachmann-hierarchy, From Kruskal’s theorem to Friedman’s gap condition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof-theoretic investigations on Kruskal's theorem
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- Complexity bounds for some finite forms of Kruskal's theorem
- The theory of well-quasi-ordering: a frequently discovered concept
- Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
- Generalizations of the Kruskal-Friedman theorems
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
- Bounds for the closure ordinals of replete monotonic increasing functions
- An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy
- Orderings of monomial ideals
