Partition theorems from creatures and idempotent ultrafilters
by Roslanowski and Shelah. [RoSh:957]
Annals Combinatorics, 2013
We show a general scheme of Ramsey-type results for partitions
of countable sets of finite functions, where ``one piece is big''
interpreted in the language originating in creature forcing.
heart of our proofs follows Glazer's proof of the Hindman Theorem,
so we prove the existence of idempotent ultrafilters with respect to
suitable operation. Then we deduce partition theorems related to
Back to the list of publications