Search Results for ""

A lattice embedding is a one-to-one lattice homomorphism.

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A uniquely complemented lattice is a complemented lattice (L, ^ , v ,0,1,^') that satisfies ( forall x in L)( forall y in L)[(x ^ y=0) ^ (x v y=1)]=>y=x^'. The class of ...

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...

The terms "measure," "measurable," etc. have very precise technical definitions (usually involving sigma-algebras) that can make them appear difficult to understand. However, ...

The points on a line can be put into a one-to-one correspondence with the real numbers.

omega^epsilon=epsilon, where omega is an ordinal number and epsilon is an inaccessible cardinal.

A partial order defined by (i-1, i), (i+1, i) for odd i.

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