A game-theoretic argument proves Shelah's theorem: families of λ-labeled trees of sufficiently large cardinality contain a homomorphism between two distinct trees.
Better quasi-orders for uncountable cardina ls
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A game-theoretic proof of Shelah's theorem on labeled trees
A game-theoretic argument proves Shelah's theorem: families of λ-labeled trees of sufficiently large cardinality contain a homomorphism between two distinct trees.