 A well-ordered set is a pair W = (W, &lt;),  where &lt; is a relation on  the set W which is a strict linear order and with the property that every non-empty subset of W has a &lt;-least element.  For example, (N, &lt; ) is a well-order, where &lt; is given by 