Embedding of free Boolean algebras in complete Boolean algebras
β Scribed by S. V. Kislyakov
- Publisher
- Springer US
- Year
- 1975
- Tongue
- English
- Weight
- 82 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
The notion of a BooLEan algebra with operators was introduced by J~NSSON and TARSKI [ 5 ] . It encompasses as special cases relation algebras (TARSKI [9]), closure algebras (MCKINSEY-TARSKI [S]), cylindric algebras (HENRIN-TARSKI [4]), polyadic algebras (HALMOS [Z]), and other algebras which have be