Chains and antichains in Boolean algebras
We give an affirmative answer to problem DJ from Fremlin’s list [8] which asks whether implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.
We give an affirmative answer to problem DJ from Fremlin’s list [8] which asks whether implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.
We introduce the notion of a coherent -ultrafilter on a complete ccc Boolean algebra, strengthening the notion of a -point on , and show that these ultrafilters exist generically under . This improves the known existence result of Ketonen [On the existence of -points in the Stone-Čech compactification of integers, Fund. Math. 92 (1976), 91–94]. Similarly, the existence theorem of Canjar [On the generic existence of special ultrafilters, Proc. Amer. Math. Soc. 110 (1990), no. 1, 233–241] can...