Search Results for ""

A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.

An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a ...

An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

The four of Hilbert's axioms which concern the arrangement of points.

Physicists and engineers use the phrase "order of magnitude" to refer to the smallest power of ten needed to represent a quantity. Two quantities A and B which are within ...

Let (A,<=) and (B,<=) be disjoint totally ordered sets with order types alpha and beta. Then the ordinal sum is defined at set (C=A union B,<=) where, if c_1 and c_2 are both ...

Let (A,<=) and (B,<=) be well ordered sets with ordinal numbers alpha and beta. Then alpha<beta iff A is order isomorphic to an initial segment of B (Dauben 1990, p. 199). ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...