Search Results for ""

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

A partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

For a partial order, the size of the longest antichain is called the width.

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

Given a sample of n variates X_1, ..., X_N, reorder them so that Y_1<Y_2<...<Y_N. Then Y_i is called the ith order statistic (Hogg and Craig 1970, p. 146), sometimes also ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

For a partial order, the size of the longest chain is called the length.

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...