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.

Words nearby well-ordering theorem