Definition:Directed Ordering

From ProofWiki
Jump to navigation Jump to search


Let $\struct {S, \preccurlyeq}$ be an ordered set.

Let $\struct {S, \preccurlyeq}$ be such that:

$\forall x, y \in S: \exists z \in S: x \preccurlyeq z$ and $y \preccurlyeq z$

That is, such that every pair of elements of $S$ has an upper bound in $S$.

Then $\preccurlyeq$ is a directed ordering.

Also see

  • Results about directed orderings can be found here.