˜yÐÄvlog

Advertisement

Advertisement

well-ordering theorem

[ wel-awr-der-ing ]

noun

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

Advertisement

Advertisement

Advertisement

Advertisement

Browse

  • #
  • aa
  • bb
  • cc
  • dd
  • ee
  • ff
  • gg
  • hh
  • ii
  • jj
  • kk
  • ll
  • mm
  • nn
  • oo
  • pp
  • qq
  • rr
  • ss
  • tt
  • uu
  • vv
  • ww
  • xx
  • yy
  • zz