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.
It was proved by Juhász and Weiss that for every ordinal α with there is a superatomic Boolean algebra of height α and width ω. We prove that if κ is an infinite cardinal such that and α is an ordinal such that , then there is a cardinal-preserving partial order that forces the existence of a superatomic Boolean algebra of height α and width κ. Furthermore, iterating this forcing through all , we obtain a notion of forcing that preserves cardinals and such that in the corresponding generic...
We present a groupoid which can be converted into a Boolean algebra with respect to term operations. Also conversely, every Boolean algebra can be reached in this way.
We show that splitting of elements of an independent family of infinite regular size will produce a full size independent set.
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
In the present paper we deal with the relations between direct product decompositions of a directed set and direct product decompositions of intervals of .
We study conditions on automorphisms of Boolean algebras of the form (where λ is an uncountable cardinal and is the ideal of sets of cardinality less than κ ) which allow one to conclude that a given automorphism is trivial. We show (among other things) that every automorphism of which is trivial on all sets of cardinality κ⁺ is trivial, and that implies both that every automorphism of (ℝ)/Fin is trivial on a cocountable set and that every automorphism of (ℝ)/Ctble is trivial.