Game properties of Boolean algebras
We prove that any countable set of surjective functions on an infinite set of cardinality ℵₙ with n ∈ ℕ can be generated by at most n²/2 + 9n/2 + 7 surjective functions of the same set; and there exist n²/2 + 9n/2 + 7 surjective functions that cannot be generated by any smaller number of surjections. We also present several analogous results for other classical infinite transformation semigroups such as the injective functions, the Baer-Levi semigroups, and the Schützenberger monoids.
We present principles for guessing clubs in the generalized club filter on . These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ⁺-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflection points for stationary subsets of .