Definition:Well-Founded Ordered Set

From ProofWiki
(Redirected from Definition:Well-Founded)
Jump to navigation Jump to search
Not to be confused with Definition:Well-Founded Set.

Definition

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


Then $\struct {S, \preceq}$ is well-founded if and only if it satisfies the minimal condition:

Every non-empty subset of $S$ has a minimal element.


The term well-founded can equivalently be said to apply to the ordering $\preceq$ itself rather than to the ordered set $\struct {S, \preceq}$ as a whole.


Also see


Stronger properties


Generalization


Sources