Some combinatorics involving $\xi $-large sets
Volume 175 / 2002
Fundamenta Mathematicae 175 (2002), 119-125
MSC: Primary 05A18.
DOI: 10.4064/fm175-2-2
Abstract
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 $\xi $-large trees. Here $\xi <\varepsilon _ 0$ and the notion of largeness is in the sense of Hardy hierarchy.
