Search Results for ""

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.

A meromorphic function is a single-valued function that is analytic in all but possibly a discrete subset of its domain, and at those singularities it must go to infinity ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

If a function analytic at the origin has no singularities other than poles for finite x, and if we can choose a sequence of contours C_m about z=0 tending to infinity such ...

The direct sum of modules A and B is the module A direct sum B={a direct sum b|a in A,b in B}, (1) where all algebraic operations are defined componentwise. In particular, ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...

In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...