Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
From MaRDI portal
DOI10.2307/1971481zbMATH Open0684.05016OpenAlexW2331677784WikidataQ123010475 ScholiaQ123010475MaRDI QIDQ1825201FDOQ1825201
Authors: Igor Kriz 
Publication date: 1989
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1971481
Recommendations
Cited In (22)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
- Title not available (Why is that?)
- A well-quasi-order for tournaments
- Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
- Rao's degree sequence conjecture
- Strong WQO Tree Theorems
- The order type of the collection of finite series-parallel posets
- 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
- Well partial orders
- From Kruskal’s theorem to Friedman’s gap condition
- Generalizing Kruskal's theorem to pairs of cohabitating trees
- On well-quasi-ordering finite structures with labels
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Gap embedding for well-quasi-orderings
- Calculating maximal order types for finite rooted unstructured labeled trees
- On better quasi-ordering countable 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)
