Search Results for ""

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.

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 ...

A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...

alpha is called a predecessor if there is no ordinal number beta such that beta+1=alpha.

A reflexive relation.

Two partially ordered sets are said to be isomorphic if their "structures" are entirely analogous. Formally, partially ordered sets P=(X,<=) and Q=(X^',<=^') are isomorphic ...

A theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...

A metric space X which is not complete has a Cauchy sequence which does not converge. The completion of X is obtained by adding the limits to the Cauchy sequences. For ...

A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...