Generalizations and Galois-Tukey Connections
It is possible to see the hat problem on the parity relation as actually being a two-agent hat problem, though we must consider a more general type of hat problem; in doing so, we uncover a close relationship with so-called Galois-Tukey connections. In this final chapter, we explore the relationships between results extending those in Chapter 4 and these Galois-Tukey connections.
KeywordsInfinite Chain Visibility Graph Actual Color Cardinal Invariant Acceptability Relation
- [V93]Vojtáš, P.: Generalized Galois-Tukey connections between explicit relations on classical objects of real analysis. In: Judah, H. (ed.) Set Theory of the Reals, Israel Mathematical Conference Proceedings, vol. 6, pp. 619–643. American Mathematical Society, Providence (1993)Google Scholar
- [Yip94]Yiparaki, O.: On some tree partitions. PhD thesis, University of Michigan (1994)Google Scholar