(mathematics) | well-ordered set - A set with a total ordering and no infinite
descending chains. A total ordering "<=" satisfiesx <= x x <= y <= z => x <= z x <= y <= x => x = y for all x, y: x <= y or y <= x In addition, if a set W is well-ordered then all non-empty subsets A of W have a least element, i.e. there exists x in A such that for all y in A, x <= y. Ordinals are isomorphism classes of well-ordered sets, just as integers are isomorphism classes of finite sets. |

Browse

well-lighted

Well-liking

well-lined

well-made

Well-mannered

well-marked

well-matched

Well-meaner

Well-meaning

well-meant

well-mined

Well-natured

Well-nigh

well-nourished

well-off

well-ordered

**-- well-ordered set --**

Well-plighted

well-preserved

well-proportioned

well-qualified

Well-read

well-rounded

Well-seen

Well-set

well-shaven

well-situated

Well-sped

Well-spoken

well-stacked

well-thought-of

well-timed

well-to-do

Well-liking

well-lined

well-made

Well-mannered

well-marked

well-matched

Well-meaner

Well-meaning

well-meant

well-mined

Well-natured

Well-nigh

well-nourished

well-off

well-ordered

Well-plighted

well-preserved

well-proportioned

well-qualified

Well-read

well-rounded

Well-seen

Well-set

well-shaven

well-situated

Well-sped

Well-spoken

well-stacked

well-thought-of

well-timed

well-to-do