Abstract: | We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) |