Pages that link to "Item:Q3576087"
From MaRDI portal
The following pages link to A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087):
Displaying 8 items.
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Minimal bad sequences are necessary for a uniform Kruskal theorem (Q2125990) (← links)
- Well-partial-orderings and the big Veblen number (Q2257112) (← links)
- How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems (Q3195714) (← links)
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders (Q3295145) (← links)
- Bachmann-Howard derivatives (Q6103503) (← links)
- Well partial orders (Q6612816) (← links)
