Microsoft Store
 

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 ~

Introduction
Formal definition
Examples
Order theoretic properties
Principle of duality
Other notation
Homomorphisms and isomorphisms
Boolean rings, ideals and filters
Representing Boolean algebras
Axiomatic Bases for Boolean algebras
See also
External links

 

 

~ What's Hot ~


~ 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.