Search Results for ""

A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...

An algebra with no nontrivial nilpotent ideals. In the 1890s, Cartan, Frobenius, and Molien independently proved that any finite-dimensional semisimple algebra over the real ...

A semiprime ring which is also an Artinian ring.

An expression which is a sentence or which contains variables and becomes a sentence upon appropriate substitutions for these variables (Carnap 1958, p. 24). Sentential ...

A sentential variable, also called a propositional variable, that can be substituted for in arbitrary sentential formulas (Carnap 1958, p. 24).

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).

A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

Given a subalgebra A of the algebra B(H) of bounded linear transformations from a Hilbert space H onto itself, the vector v in H is a separating vector for A if the only ...