Let 5 be a family of subsets of an n-set, considered as a subposet of the Boolean algebra B.. Adjoin a minimum 0 and maximum i if necessary to form @. Let ~(95) denote the value of the Mdbius function p(6,i) in &. We compute the maximum value of Ip( as 9 ranges over three types of families in B,: lo
On independent subsets of Boolean algebras
✍ Scribed by Winfried Just; Martin Weese
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 179 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
If Ä ¿ ! is a cardinal, a complete Boolean algebra B is called Ä-dependent if for each sequence b ÿ : ÿ ¡ Ä of elements of B there exists a partition of the unity, P, such that each p ∈ P extends b ÿ or b ÿ , for Ä-many ÿ ∈ Ä. The connection of this property with cardinal functions, distributivity l
The original theme of the paper is the existence proof of "there is η = η α : α < λ which is a (λ, J )-sequence for Ī = I i : i < δ , a sequence of ideals". This can be thought of as a generalization to Luzin sets and Sierpinski sets, but for the product i<δ dom(I i ), the existence proofs are relat