Search Results for ""

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

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 group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...

A group automorphism is an isomorphism from a group to itself. If G is a finite multiplicative group, an automorphism of G can be described as a way of rewriting its ...