Definition:Convex Set (Order Theory)

Definition
Let $\left({S, \preceq}\right)$ be an ordered set.

A subset $A$ of $S$ is said to be convex (in $S$) iff:
 * $\forall x, y \in A: \forall z \in S: x \preceq z \preceq y \implies z \in A$