Search Results for ""

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic sentential formula Phi in Skolemized form forall x_1... forall x_nS, then a clause ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then a literal obtained from ...

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

A general term which refers to an increase (or decrease in the case of the oxymoron "negative growth") in a given quantity.

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

The H-fractal is a fractal constructed by starting with the line segments corresponding to a capital letter H, then iteratively placing smaller H's centered at the top and ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.