Boolean Algebra


	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

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

RSS

Atom