meetMeet2002-02-24 17:04:542005-02-26 05:19:03Definitionmeet-semilatticemeet semilatticelower semilattice\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}Certain posets $X$ have a binary operation \emph{meet} denoted by $\land$, such that $x \land y$ is the greatest lower bound of $x$ and $y$. Such posets are called \emph{meet-semilattices}, or \emph{$\land$-semilattices}, or \emph{lower semilattices}.
If $m$ and $m'$ are both meets of $x$ and $y$, then $m \leq m'$ and $m \geq m'$, and so $m = m'$; thus a meet, if it exists, is unique. The meet is also known as the \emph{and operator}.