Definition:Order Complete Set/Definition 2
Jump to navigation
Jump to search
Definition
Let $\struct {S, \preceq}$ be an ordered set.
$\struct {S, \preceq}$ is order complete if and only if:
- Each non-empty subset $H \subseteq S$ which has a lower bound admits an infimum.
Also see
Sources
- 1955: John L. Kelley: General Topology ... (previous) ... (next): Chapter $0$: Orderings