Search Results for ""

A sequent is an expression Gamma|-Lambda, where Gamma and Lambda are (possibly empty) sequences of formulas. Here, Gamma is called the antecedent and Lambda is called the ...

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 ...

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...

A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...

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 ...

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

The intersection product for classes of rational equivalence between cycles on an algebraic variety.

Let G be a locally compact Abelian group. Let G^* be the group of all continuous homeomorphisms G->R/Z, in the compact open topology. Then G^* is also a locally compact ...

Teichmüller's theorem asserts the existence and uniqueness of the extremal quasiconformal map between two compact Riemann surfaces of the same genus modulo an equivalence ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...