Search Results for ""

The subset consisting of all elements of a given set is called an improper subset (Kamke 1950, p. 6).

An inaccessible cardinal is a cardinal number which cannot be expressed in terms of a smaller number of smaller cardinals.

Given a subset B of a set A, the injection f:B->A defined by f(b)=b for all b in B is called the inclusion map.

A disjunction that remains true if either or both of its arguments are true. This is equivalent to the OR connective. By contrast, the exclusive disjunction is true if only ...

A formal theory is said to be incomplete if it contains fewer theorems than would be possible while still retaining consistency.

The indefinite summation operator Delta^(-1) for discrete variables, is the equivalent of integration for continuous variables. If DeltaY(x)=y(x), then Delta^(-1)y(x)=Y(x).

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.