Abstract
AbstractHarvey Friedman’s gap condition on embeddings of finite labelled trees plays an important role in combinatorics (proof of the graph minor theorem) and mathematical logic (strong independence results). In the present paper we show that the gap condition can be reconstructed from a small number of well-motivated building blocks: It arises via iterated applications of a uniform Kruskal theorem.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Well ordering principles for iterated $$\Pi ^1_1$$-comprehension;Selecta Mathematica;2023-10-12
2. The uniform Kruskal theorem: between finite combinatorics and strong set existence;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
3. Fixed Points and Noetherian Topologies;Lecture Notes in Computer Science;2023
4. Bachmann–Howard derivatives;Archive for Mathematical Logic;2022-10-26
5. Counting Embeddings of Rooted Trees into Families of Rooted Trees;The Electronic Journal of Combinatorics;2022-09-09