Advertisement

Dual Hat Problems, Ideals, and the Uncountable

  • Christopher S. Hardin
  • Alan D. Taylor
Chapter
Part of the Developments in Mathematics book series (DEVM, volume 33)

Abstract

We begin the chapter by studying “dual hat problems” where, roughly speaking, notions corresponding to injective functions or subsets are altered by considering surjective functions or partitions. Within the hat problem metaphor this shifts the focus from near-sightedness to colorblindness. It turns out that the μ-predictor has something to say in the dual hat problem as well.

We then move on to ideals on both countable and uncountable sets and investigate various ideal theoretic properties (weak P-pointedness, weak Q-pointedness, weak selectivity) and partition relations in this context. We also see the role played by non-regular ultrafilters as we try to extend an earlier result from the countable to the uncountable. Finally, we establish the equivalence of a hat-problem and the GCH.

Keywords

Visibility Graph Large Cardinal Transitive Graph Partition Relation Graph Versus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Bibliography

  1. [BM90]
    Banaschewski, B., Moore, G.H.: The dual Cantor-Bernstein theorem and the partition principle. Notre Dame J. Form. Logic 31(3), 375–381 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [BT78]
    Baumgartner, J.E., Taylor, A.D.: Partition theorems and ultrafilters. Trans. Am. Math. Soc. 241, 283–309 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [BTW82]
    Baumgartner, J.E., Taylor, A.D., Wagon, S.: Structural properties of ideals. Dissertationes Math. 197, 1–99 (1982)MathSciNetGoogle Scholar
  4. [CS84]
    Carlson, T.J., Simpson, S.G.: A dual form of Ramsey’s theorem. Adv. Math. 53, 265–290 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [EHMR84]
    Erdős, P., Hajnal, A., Máté, A., Rado, R.: Combinatorial Set Theory: Partition Relations for Cardinals. North-Holland, Amsterdam (1984)Google Scholar
  6. [GR71]
    Graham, R., Rothschild, B.: A survey of finite Ramsey theory. In: Proceedings of the 2nd Louisiana Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, pp. 21–40 (1971)Google Scholar
  7. [G71]
    Grigorieff, S.: Combinatorics on ideals and forcing. Ann. Math. Logic 3(4), 363–394 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  8. [H10]
    Hardin, C.S.: On transitive subrelations of binary relations. J. Symb. Logic 76, 1429–1440 (2010)MathSciNetCrossRefGoogle Scholar
  9. [Mat77]
    Mathias, A.R.D.: Happy families. Ann. Math. Logic 12, 59–111 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  10. [Yip94]
    Yiparaki, O.: On some tree partitions. PhD thesis, University of Michigan (1994)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Christopher S. Hardin
    • 1
  • Alan D. Taylor
    • 2
  1. 1.New YorkUSA
  2. 2.Department of MathematicsUnion CollegeSchenectadyUSA

Personalised recommendations