well-ordered

  • 31well-ordering theorem — /wel awr deuhr ing/, Math. the theorem of set theory that every set can be made a well ordered set. * * * …

    Universalium

  • 32well-ordering — ¦ ̷ ̷ ˈ ̷ ̷ ( ̷ ̷ ) ̷ ̷ noun ( s) : an instance of being well ordered …

    Useful english dictionary

  • 33well-ordering theorem — /wel awr deuhr ing/, Math. the theorem of set theory that every set can be made a well ordered set …

    Useful english dictionary

  • 34ordered — [adj] orderly all together, arranged, businesslike, controlled, disciplined, in good shape, in order, law abiding, methodical, neat, organized, peaceable, precise, shipshape*, systematic, systematized, tidy, well behaved, well organized; concepts …

    New thesaurus

  • 35well-dis|ci|plined — «WEHL DIHS uh plihnd», adjective. 1. carefully trained; conditioned or ordered well: »a well disciplined body or mind. 2. having controls; following an established order and methods: »a relic of the past, when archaeology was a rich man s hobby… …

    Useful english dictionary

  • 36Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use&#8230; …

    Wikipedia

  • 37Ordered pair — In mathematics, an ordered pair (a, b) is a pair of mathematical objects. In the ordered pair (a, b), the object a is called the first entry, and the object b the second entry of the pair. Alternatively, the objects are called the first and&#8230; …

    Wikipedia

  • 38Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such&#8230; …

    Wikipedia

  • 39Ordered graph — An ordered graph is a graph with a total order over its nodes. In an ordered graph, the parents of a node are the nodes that are joined to it and precede it in the ordering. More precisely, n is a parent of m in the ordered graph if and n &lt; m …

    Wikipedia

  • 40As well — Well Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la;&#8230; …

    The Collaborative International Dictionary of English