Search Results for ""
9831 - 9840 of 13131 for booleanalgebra.htmlSearch Results

A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.
The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...
A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...
A crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...
A reducible fraction is a fraction p/q such that GCD(p,q)>1, i.e., p/q can be written in reduced form. A fraction that is not reducible is said to be irreducible. For ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
A method of proof which proceeds by stating a proposition and then showing that it results in a contradiction, thus demonstrating the proposition to be false. In the words of ...
A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...
A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...
If a fixed point is added to each group of a special complete series, then the resulting series is complete.

...