Dense subtrees in complete Boolean algeb
✍
Bernhard König
📂
Article
📅
2006
🏛
John Wiley and Sons
🌐
English
⚖ 94 KB
👁 1 views
## 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