well-ordering theorem

[ wel-awr-der-ing ]
/ ˈwɛlˈɔr dər ɪŋ /

noun Mathematics.

the theorem of set theory that every set can be made a well-ordered set.

Nearby words

  1. well-nigh,
  2. well-off,
  3. well-oiled,
  4. well-ordered,
  5. well-ordered set,
  6. well-organized,
  7. well-padded,
  8. well-paid,
  9. well-placed,
  10. well-planned

Dictionary.com Unabridged Based on the Random House Unabridged Dictionary, © Random House, Inc. 2019