From Kruskal’s theorem to Friedman’s gap condition
Mathematical Structures in Computer Science · 2020-09 · 30 (8) · 952-975
DOI: 10.1017/s0960129520000298 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Structures in Computer Science, online erschienen am 29.01.2021. Verfasst von Anton Freund. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 28 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Freund, A. (2020). From Kruskal’s theorem to Friedman’s gap condition. Mathematical Structures in Computer Science, 30(8), 952-975. https://doi.org/10.1017/s0960129520000298
Vancouver
Freund A. From Kruskal’s theorem to Friedman’s gap condition. Mathematical Structures in Computer Science. 2020;30(8):952-975. doi:10.1017/s0960129520000298
BibTeX
@article{Freund2020,
author = {Freund, Anton},
title = {From Kruskal’s theorem to Friedman’s gap condition},
journal = {Mathematical Structures in Computer Science},
year = {2020},
volume = {30},
number = {8},
pages = {952--975},
doi = {10.1017/s0960129520000298}
}
EUVIMED