Search Results for ""

In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

Let h:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) be efficiently computable by an algorithm (solving a P-problem). For fixed y in {0,1}^(l(n)), view h(x,y) as a function h_y(x) of x ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

The validity of a logical argument refers to whether or not the conclusion follows logically from the premises, i.e., whether it is possible to deduce the conclusion from the ...

Delta(x_1,...,x_n) = |1 x_1 x_1^2 ... x_1^(n-1); 1 x_2 x_2^2 ... x_2^(n-1); | | | ... |; 1 x_n x_n^2 ... x_n^(n-1)| (1) = product_(i,j; i>j)(x_i-x_j) (2) (Sharpe 1987). For ...

A variety is a class of algebras that is closed under homomorphisms, subalgebras, and direct products. Examples include the variety of groups, the variety of rings, the ...