Search Results for ""

An associative ring, also called a Hecke ring, which has a technical definition in terms of commensurable subgroups.

X subset= R^n is semianalytic if, for all x in R^n, there is an open neighborhood U of x such that X intersection U is a finite Boolean combination of sets {x^_ in ...

In continuum percolation theory, the so-called germ-grain model is an obvious generalization of both the Boolean and Boolean-Poisson models which is driven by an arbitrary ...

Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...

An operator A^~ such that A^~^2=A^~ or an element of an algebra x such that x^2=x.

The law appearing in the definition of Boolean algebras and lattice which states that a ^ (a v b)=a v (a ^ b)=a for binary operators v and ^ (which most commonly are logical ...

A semialgebraic set is a subset of R^n which is a finite Boolean combination of sets of the form {x^_=(x_1,...,x_n):f(x^_)>0} and {x^_:g(x^_)=0}, where f and g are ...

A symbol used to represent a Boolean statement in logic that can take the value either true or false. All statement letters are statements forms (Mendelson 1997, p. 13).

Lattice theory is the study of sets of objects known as lattices. It is an outgrowth of the study of Boolean algebras, and provides a framework for unifying the study of ...

Denoted sl_n.