𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On well-generated Boolean algebras

✍ Scribed by Robert Bonnet; Matatyahu Rubin


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
390 KB
Volume
105
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

✦ Synopsis


A Boolean algebra B that has a well-founded sublattice L which generates B is called a well-generated (WG) Boolean algebra. If in addition, L is generated by a complete set of representatives for B (see DeΓΏnition 1:1), then B is said to be canonically well-generated (CWG).

Every WG Boolean algebra is superatomic. We construct two basic examples of superatomic non well-generated Boolean algebras. Their cardinal sequences are β„΅1; β„΅0; β„΅1; 1 and β„΅0; β„΅0; 2 β„΅ 0 ; 1 .

Assuming MA ∧ (β„΅1Β‘2 β„΅ 0 ), we show that every algebra with one of the cardinal sequences β„΅0: iΒ‘ Λ† ; β„΅1; 1 , Β‘β„΅1; Β‘2 β„΅ 0 , or β„΅0; 2 β„΅ 0 ; β„΅1; 1 is CWG.

Assuming CH, or alternatively assuming MA ∧ (2 β„΅ 0 = β„΅2), we determine which cardinal sequences admit only WG Boolean algebras.

We ΓΏnd a necessary and su cient condition for the canonical well-generatedness of algebras whose cardinal sequence has the form β„΅0: iΒ‘ Λ† ; 1 , Β‘β„΅1. We conclude that if such an algebra is CWG, then all of its quotients are CWG. We show that the above is not true for general Boolean algebras. We also conclude that if the cardinality of such an algebra is less than the cardinal b deΓΏned below, then it is CWG. The cardinal b is the least cardinality of an unbounded subset of {f | f : ! β†’ !}.

We investigate questions concerning embeddability, quotients and subalgebras of WG and CWG Boolean algebras, and construct various counter-examples.


πŸ“œ SIMILAR VOLUMES


Boolean algebras R-generated by MV-effec
✍ Gejza Jenča πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 213 KB

We prove that every MV-e ect algebra M is, as an e ect algebra, a homomorphic image of its R-generated Boolean algebra. We characterize central elements of M in terms of the constructed homomorphism.

Closure Algebras and Boolean Algebras
✍ G. J. Logan πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 212 KB

## S(z A y ) z S(A), by (c) * S(z) A S(Y) 2 S(A) e S(x) 2 S(A) and S(y) 2 S(A) e C ( s ) s C ( A ) 'and C ( y ) E C ( A ) , by (c) o x € C ( A ) and Y E C ( A ) . Now every ultrafilter is consistent and closed with respect to C, since if U is an ultrafilter and C ( U ) = X , then C({,uu,, . . ., ,

Fuzzy Boolean algebras
✍ Josette Coulon; Jean-Louis Coulon πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 307 KB
Narrow boolean algebras
✍ Robert Bonnet; Saharon Shelah πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 772 KB