Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture

DOI10.2307/1971481zbMath0684.05016OpenAlexW2331677784WikidataQ123010475 ScholiaQ123010475MaRDI QIDQ1825201

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

zbMATH Keywords

labelled treewell-quasiorderingfinite trees with edges labelled by ordinalsgap-condition

Mathematics Subject Classification ID

Trees (05C05) Other combinatorial set theory (03E05)

Related Items

How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems, Well-quasi-order of relabel functions, A well-quasi-order for tournaments, Rao's degree sequence conjecture, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, Strong WQO Tree Theorems, Ordinal arithmetic with simultaneously defined theta-functions, Well-partial-orderings and the big Veblen number, Gap Embedding for Well-Quasi-Orderings, From Kruskal’s theorem to Friedman’s gap condition, Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation