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.