From ProofWiki
Jump to navigation Jump to search

This category contains results about Well-Orderings.
Definitions specific to this category can be found in Definitions/Well-Orderings.

The ordering $\preceq$ is a well-ordering on $S$ if and only if every non-empty subset of $S$ has a smallest element under $\preceq$:

$\forall T \subseteq S, T \ne \O: \exists a \in T: \forall x \in T: a \preceq x$


This category has the following 4 subcategories, out of 4 total.

Pages in category "Well-Orderings"

The following 54 pages are in this category, out of 54 total.