Boolean algebra
:For a basic intro to sets, Boolean operations, Venn diagrams, truth tables, and Boolean applications, see Boolean logic.
Representing Boolean algebras
It can be shown that every finite Boolean algebra is isomorphic to the Boolean algebra of all subsets of a finite set. Therefore, the number of elements of every finite Boolean algebra is a power of two.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
Stone's celebrated representation theorem for Boolean algebras states that every Boolean algebra A is isomorphic to the Boolean algebra of all closed-open sets in some (compact totally disconnected Hausdorff) topological space.
Related Topics:
Stone's - Representation theorem for Boolean algebras - Closed-open - Compact - Totally disconnected - Hausdorff
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
~ What's Hot ~
Madagascar 3, All About Steve, The Princess And The Frog, The Blind Side, The Karate Kid, Clash Of The Titans, Up In The Air, The Mummy 4 Rise Of The Aztec, The Boondock Saints Ii All Saints Day, Sorority Row, Avatar, The Hangover, New Moon, My Sister S Keeper, Alvin And The Chipmunks The Squeakquel, The Goods Live Hard Sell Hard, Hannah Montana The Movie, Legion, Dear John, 500 Days Of Summer,
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.