Orderable
Look at other dictionaries:
orderable — adjective see order I … New Collegiate Dictionary
orderable — adjective That may be ordered (obtained by an order, or put in sequence) … Wiktionary
orderable — … Useful english dictionary
order — orderable, adj. orderer, n. orderless, adj. /awr deuhr/, n. 1. an authoritative direction or instruction; command; mandate. 2. a command of a court or judge. 3. a command or notice issued by a military organization or a military commander to… … Universalium
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Group ring — This page discusses the algebraic group ring of a discrete group; for the case of a topological group see group algebra, and for a general group see Group Hopf algebra. In algebra, a group ring is a free module and at the same time a ring,… … Wikipedia
Von Neumann cardinal assignment — The von Neumann cardinal assignment is a cardinal assignment which uses ordinal numbers. For a well ordered set U , we define its cardinal number to be the smallest ordinal number equinumerous to U . More precisely,:|U| = mathrm{card}(U) = inf {… … Wikipedia
Regular cardinal — In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. So, crudely speaking, a regular cardinal is one which cannot be broken into a smaller collection of smaller parts.(The situation is slightly more… … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
