… Searc

Boolean algebra (structure)

Article Talk

… … …
For an introduction to the subject, see Boolean
algebra. For an alternative presentation, see
Boolean algebras canonically defined.

In abstract algebra, a Boolean algebra or

Boolean lattice is a complemented distributive
lattice. This type of algebraic structure
captures essential properties of both set
operations and logic operations. A Boolean
algebra can be seen as a generalization of a
power set algebra or a field of sets, or its
elements can be viewed as generalized truth
values. It is also a special case of a De Morgan
algebra and a Kleene algebra (with involution).

Every Boolean algebra gives rise to a Boolean

ring, and vice versa, with ring multiplication
corresponding to conjunction or meet ∧, and
ring addition to exclusive disjunction or
symmetric difference (not disjunction ∨).
However, the theory of Boolean rings has an
inherent asymmetry between the two
operators, while the axioms and theorems of
Boolean algebra express the symmetry of the
theory described by the duality principle.[1]

Boolean lattice of subsets

History

Definition

Examples

Homomorphisms and
isomorphisms

Boolean rings

Ideals and filters

Representations

Axiomatics

Generalizations

See also

Notes

References

External links

Last edited 2 days ago by Mgkrupa

Content is available under CC BY-SA 3.0 unless

otherwise noted.

Terms of Use • Privacy policy • Desktop