Boolean Algebra

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

A partial order on subsets defined by inclusion is a Boolean algebra. Boolean algebras form lattices and have a recursive structure apparent in their Hasse diagrams. The Hasse diagram for a Boolean algebra of order illustrates the partition between left and right halves of the lattice, each of which is the Boolean algebra on elements.

Contributed by: Eric W. Weisstein (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send