enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Order theory - Wikipedia

    en.wikipedia.org/wiki/Order_theory

    Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that".

  3. List of order theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_order_theory_topics

    Order theory is a branch of mathematics that studies various kinds of objects (often binary relations) that capture the intuitive notion of ordering, providing a framework for saying when one thing is "less than" or "precedes" another. An alphabetical list of many notions of order theory can be found in the order theory glossary.

  4. Glossary of order theory - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_order_theory

    The order dual of a partially ordered set is the same set with the partial order relation replaced by its converse. Order-embedding . A function f between posets P and Q is an order-embedding if, for all elements x , y of P , x ≤ y (in P ) is equivalent to f ( x ) ≤ f ( y ) (in Q ).

  5. Ideal (order theory) - Wikipedia

    en.wikipedia.org/wiki/Ideal_(order_theory)

    Order theory knows many completion procedures to turn posets into posets with additional completeness properties. For example, the ideal completion of a given partial order P is the set of all ideals of P ordered by subset inclusion. This construction yields the free dcpo generated by P.

  6. Order (group theory) - Wikipedia

    en.wikipedia.org/wiki/Order_(group_theory)

    The consequences of the theorem include: the order of a group G is a power of a prime p if and only if ord(a) is some power of p for every a in G. [2] If a has infinite order, then all non-zero powers of a have infinite order as well. If a has finite order, we have the following formula for the order of the powers of a: ord(a k) = ord(a) / gcd ...

  7. Join and meet - Wikipedia

    en.wikipedia.org/wiki/Join_and_meet

    In mathematics, specifically order theory, the join of a subset of a partially ordered set is the supremum (least upper bound) of , denoted , and similarly, the meet of is the infimum (greatest lower bound), denoted .

  8. Order type - Wikipedia

    en.wikipedia.org/wiki/Order_type

    The order type of the integers and rationals is usually denoted and , respectively. The set of integers and the set of even integers have the same order type, because the mapping n ↦ 2 n {\displaystyle n\mapsto 2n} is a bijection that preserves the order.

  9. Order (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Order_(mathematics)

    Order, an academic journal on order theory; Dense order, a total order wherein between any unequal pair of elements there is always an intervening element in the order; Glossary of order theory; Lexicographical order, an ordering method on sequences analogous to alphabetical order on words; List of order topics, list of order theory topics