Skip to main content
Log in

Partition Theorems from Creatures and Idempotent Ultrafilters

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bartoszyński T., Judah H.: Set Theory: On the Structure of the Real Line. A K Peters. Wellesley, MA (1995)

    Google Scholar 

  2. Carlson T.J., Simpson S.G.: A dual form of Ramsey’s theorem. Adv. in Math. 53, 265–290 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Comfort W.W.: Ultrafilters: some old and some new results. Bull. Amer. Math. Soc. 83, 417–455 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goldstern M., Shelah S.: Ramsey ultrafilters and the reaping number—\({{\rm Con}(\mathfrak{r} < \mathfrak{u})}\) . Ann. Pure Appl. Logic 49(2), 121–142 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hales A.W., Jewett R.I.: Regularity and positional games. Trans. Amer. Math. Soc. 106, 222–229 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  6. Halpern J.D., Läuchli H.: A partition theorem. Trans. Amer. Math. Soc. 124, 360–367 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kellner J., Shelah S.: Decisive creatures and large continuum. J. Symbolic Logic 74(1), 73–104 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kellner J., Shelah S.: Creature forcing and large continuum: the joy of halving. Arch. Math. Logic 51, 49–70 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Pincus D., Halpern J.D.: Partitions of products. Trans. Amer. Math. Soc. 267(2), 549–568 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rosłanowski, A., Shelah, S.: Norms on possibilities I: forcing with trees and creatures. Mem. Amer. Math. Soc. 141(671), (1999)

  11. Rosłanowski A., Shelah S.: Measured creatures. Israel J. Math. 151, 61–110 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rosłanowski A., Shelah S., Spinas O.: Nonproper products. Bull. Lond. Math. Soc. 44(2), 299–310 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Shelah S., Zapletal J.: Ramsey theorems for product of finite sets with submeasures. Combinatorica 31(2), 225–244 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrzej Rosłanowski.

Additional information

This research was supported by the United States-Israel Binational Science Foundation (Grant no. 2006108). Publication 957.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rosłanowski, A., Shelah, S. Partition Theorems from Creatures and Idempotent Ultrafilters. Ann. Comb. 17, 353–378 (2013). https://doi.org/10.1007/s00026-013-0184-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-013-0184-7

Mathematics Subject Classification

Keywords

Navigation