Acronyms that contain the term order type 

Order type

In mathematics, especially in set theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic, that is, if there exists a bijection (each element pairs with exactly one in the other set) f : X → Y {\displaystyle f\colon X\to Y} such that both f and its inverse are monotonic (preserving orders of elements). In the special case when X is totally ordered, monotonicity of f implies monotonicity of its inverse. For example, 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. But the set of integers and the set of rational numbers (with the standard ordering) do not have the same order type, because even though the sets are of the same size (they are both countably infinite), there is no order-preserving bijective mapping between them. To these two order types we may add two more: the set of positive integers (which has a least element), and that of negative integers (which has a greatest element). The open interval (0, 1) of rationals is order isomorphic to the rationals (since, for example, f ( x ) = 2 x − 1 1 − | 2 x − 1 | {\displaystyle f(x)={\tfrac {2x-1}{1-\vert {2x-1}\vert }}} is a strictly increasing bijection from the former to the latter); the rationals contained in the half-closed intervals [0,1) and (0,1], and the closed interval [0,1], are three additional order type examples. Since order-equivalence is an equivalence relation, it partitions the class of all ordered sets into equivalence classes.

see more »