well-order (Q659746)

From Wikidata
Jump to: navigation, search
(on a set S) 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
  • well-ordering
  • well-order relation
  • well-ordered set
  • Well­ordered set
edit
Language Label Description Also known as
English
well-order
(on a set S) 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
  • well-ordering
  • well-order relation
  • well-ordered set
  • Well­ordered set

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit