Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
partial_order [2008/04/30 15:20] vkuncak |
partial_order [2008/05/07 16:26] pedagand |
||
|---|---|---|---|
| Line 12: | Line 12: | ||
| Given a partial ordering relation $\le$, the corresponding **strict ordering relation** $x < y$ is defined by $x \le y \land x \neq y$ and can be viewed as a shorthand for this conjunction. | Given a partial ordering relation $\le$, the corresponding **strict ordering relation** $x < y$ is defined by $x \le y \land x \neq y$ and can be viewed as a shorthand for this conjunction. | ||
| - | We can view partial order $(A,r)$ as a first-order interpretation $I=(A,\alpha)$ of language ${\cal L}={\le\}$ where $\alpha({\le\})=r$. | + | We can view partial order $(A,r)$ as a first-order interpretation $I=(A,\alpha)$ of language ${\cal L}=\{\le\}$ where $\alpha({\le})=r$. |
| ===== Example Partial Orders ===== | ===== Example Partial Orders ===== | ||
| Line 38: | Line 38: | ||
| * **least element** of $S$ if $a \in S$ and for all $a' \in S$ we have $a \le a'$ | * **least element** of $S$ if $a \in S$ and for all $a' \in S$ we have $a \le a'$ | ||
| * **least upper bound** (lub, supremum, meet, $\sqcup$) of $S$ if $a$ is the least element in the set of all upper bounds of $S$ | * **least upper bound** (lub, supremum, meet, $\sqcup$) of $S$ if $a$ is the least element in the set of all upper bounds of $S$ | ||
| - | * **greatest lower bound** (glb, infimum, join, $\sqcap$) of $S$ if $a$ is the least element in the set of all upper bounds of $S$ | + | * **greatest lower bound** (glb, infimum, join, $\sqcap$) of $S$ if $a$ is the greatest element in the set of all lower bounds of $S$ |
| Taking $S=A$ we obtain minimal, maximal, greatest, least elements for the entire partial order. | Taking $S=A$ we obtain minimal, maximal, greatest, least elements for the entire partial order. | ||