1. Well-orderIn mathematics, a well-order relation (or well-ordering) 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. The set S together with the well-order relation is then called a well-ordered set. Every element s, except a possible greatest element, has a unique successor (next element), namely the least element of the subset of all elements greater than s. Every subset which has an upper bound has a least upper bound.
Read “Well-order” on English Wikipedia
Read “整列集合” on Japanese Wikipedia
Read “Well-order” on DBpedia
Read “Well-order” on English Wikipedia
Read “整列集合” on Japanese Wikipedia
Read “Well-order” on DBpedia
Discussions
Log in to talk about this word.