English: A diagram of an example of a De Morgan algebra. The black edges and vertices form a Hasse diagram of a bounded distributive lattice. The red dotted edges join vertices which are complements. Vertices which are not connected to red edges are their own complements. Vertices are labeled with four-bit strings. Meet and join operations are bitwise AND and OR respectively. The complement of ${\displaystyle x_{1}x_{2}x_{3}x_{4}}$ is ${\displaystyle {\bar {x}}_{2}{\bar {x}}_{1}{\bar {x}}_{4}{\bar {x}}_{3}}$, where ${\displaystyle {\bar {0}}=1}$ and ${\displaystyle {\bar {1}}=0}$.