Definition:Strict Well-Ordering/Definition 2

Definition

Let $\struct {S, \prec}$ be a relational structure.

Then $\prec$ is a strict well-ordering of $S$ if and only if:

$\prec$ is a connected relation on $S$

$\prec$ is strictly well-founded on $S$.

That is, whenever $T$ is a non-empty subset of $S$, $T$ has a strictly minimal element under $\prec$.

Also see

• Equivalence of Definitions of Strict Well-Ordering

Sources

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.