Displaying similar documents to “Optimal matrices of partitions and an application to Souslin trees”

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.

On A-Trees

Đuro Kurepa (1968)

Publications de l'Institut Mathématique

Similarity: