Sh:957
- Rosłanowski, A., & Shelah, S. (2013). Partition theorems from creatures and idempotent ultrafilters. Ann. Comb., 17(2), 353–378. arXiv: 1005.2803 DOI: 10.1007/s00026-013-0184-7 MR: 3056773
-
Abstract:
We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where “one piece is big” is interpreted in the language originating in creature forcing. The 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 creature forcings. - Version 2011-03-23_11 (22p) published version (26p)
Bib entry
@article{Sh:957,
author = {Ros{\l}anowski, Andrzej and Shelah, Saharon},
title = {{Partition theorems from creatures and idempotent ultrafilters}},
journal = {Ann. Comb.},
fjournal = {Annals of Combinatorics},
volume = {17},
number = {2},
year = {2013},
pages = {353--378},
issn = {0218-0006},
mrnumber = {3056773},
mrclass = {03E05 (03E02 05D10 54A20)},
doi = {10.1007/s00026-013-0184-7},
note = {\href{https://arxiv.org/abs/1005.2803}{arXiv: 1005.2803}},
arxiv_number = {1005.2803}
}