All Title Author
Keywords Abstract

Mathematics  2010 

Partition theorems from creatures and idempotent ultrafilters

DOI: 10.1007/s00026-013-0184-7

Full-Text   Cite this paper   Add to My Lib


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.


comments powered by Disqus

Contact Us


微信:OALib Journal