From Kruskal's theorem to Friedman's gap condition

Harvey 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.