Pages that link to "Item:Q1892123"
From MaRDI portal
The following pages link to Complexity bounds for some finite forms of Kruskal's theorem (Q1892123):
Displayed 10 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity (Q850804) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- On operations and linear extensions of well partially ordered sets (Q1765955) (← links)
- Well-partial-orderings and the big Veblen number (Q2257112) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- (Q5009706) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)