In this note we give a characterization of complete atomic Boolean algebras by means of complete atomic lattices. We find that unicity of the representation of the maximum as union of atoms and Lambda-infinite distributivity law are necessary and sufficient conditions for the lattice to be a complete atomic Boolean algebra.
We compare the forcing-related properties of a complete Boolean algebra with the properties of the convergences (the algebraic convergence) and on generalizing the convergence on the Cantor and Aleksandrov cube, respectively. In particular, we show that is a topological convergence iff forcing by does not produce new reals and that is weakly topological if satisfies condition (implied by the -cc). On the other hand, if is a weakly topological convergence, then is a -cc algebra...
Using ♢ , we construct a rigid atomless Boolean algebra that has no uncountable antichain and that admits the elimination of the Malitz quantifier .
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...