Some combinatorics involving ξ-large sets
Teresa Bigorajska, Henryk Kotlarski (2002)
Fundamenta Mathematicae
Similarity:
We prove a version of the Ramsey theorem for partitions of (increasing) n-tuples. We derive this result from a version of König's infinity lemma for ξ-large trees. Here ξ < ε₀ and the notion of largeness is in the sense of Hardy hierarchy.