Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
From MaRDI portal
(Redirected from Publication:1825201)
Recommendations
Cited in
(22)- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
- scientific article; zbMATH DE number 1160629 (Why is no real title available?)
- A well-quasi-order for tournaments
- Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
- Rao's degree sequence conjecture
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
- The order type of the collection of finite series-parallel posets
- Strong WQO Tree Theorems
- Well-partial-orderings and the big Veblen number
- Ordinal arithmetic with simultaneously defined theta-functions
- The structure of infinite Friedman trees
- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
- On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
- Well-quasi-order of relabel functions
- From Kruskal’s theorem to Friedman’s gap condition
- Generalizing Kruskal's theorem to pairs of cohabitating trees
- Well partial orders
- On well-quasi-ordering finite structures with labels
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Gap embedding for well-quasi-orderings
- On better quasi-ordering countable trees
- Calculating maximal order types for finite rooted unstructured labeled trees
This page was built for publication: Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825201)
