Order, lattices, ordered algebraic structures Boolean algebras Concept
Complete Boolean algebra
Summary
A complete Boolean algebra is a Boolean algebra in which every subset has a supremum, so that it is also a complete lattice. Power sets are complete, and so are the algebras of regular open sets of topological spaces. Every Boolean algebra embeds densely into a complete one, its completion. Complete Boolean algebras are the basic tool of Boolean-valued models and of forcing in set theory.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 75BPV95AAS |
|---|---|
| URI | m2://75BPV95AAS |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06E10 |
| Specializes | Boolean algebra |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.