Changes

In [[mathematics]], a '''lattice''' is a partially ordered set (also called a ''poset'') in which subsets of any ''two elements'' have a unique supremum (the elements' least upper bound; called their '''|join''') and an infimum (greatest lower bound; called their '''meet'''). Lattices can also be characterized as algebraic [[structure]]s satisfying certain axiomatic |identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These "lattice-like" structures all admit order-theoretic as well as algebraic descriptions.

In [[mathematics]], a '''lattice''' is a partially ordered set (also called a ''poset'') in which subsets of any ''two elements'' have a unique supremum (the elements' least upper bound; called their '''|join''') and an infimum (greatest lower bound; called their '''meet'''). Lattices can also be characterized as algebraic [[structure]]s satisfying certain axiomatic |identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These "lattice-like" structures all admit order-theoretic as well as algebraic descriptions.[http://en.wikipedia.org/wiki/Lattice_(order)]