Pages that link to "Item:Q1122597"
From MaRDI portal
The following pages link to Using unavoidable set of trees to generalize Kruskal's theorem (Q1122597):
Displaying 9 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Unavoidable languages, cuts and innocent sets of words (Q4858836) (← links)
- Embedding with patterns and associated recursive path ordering (Q5055733) (← links)
