distributive lattice

A lattice (http://planetmath.org/Lattice) is said to be distributive if it satisifes either (and therefore both) of the distributive laws (http://planetmath.org/Distributive):

• $x\wedge (y\vee z)=(x\wedge y)\vee (x\wedge z)$

• $x\vee (y\wedge z)=(x\vee y)\wedge (x\vee z)$

Every distributive lattice is modular (http://planetmath.org/ModularLattice).

Examples of distributive lattices include Boolean lattices (http://planetmath.org/BooleanLattice), totally ordered sets, and the subgroup lattices (http://planetmath.org/LatticeOfSubgroups) of locally cyclic groups.