A well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering.
I took a non-empty subset (0,1) but this set doesn't have any least element.
64.3k questions
77.9k answers
244k comments
80.0k users