Search Results for ""

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

A phenomenon in which a system being forced at an irrational period undergoes rational, periodic motion which persists for a finite range of forcing values. It may occur for ...

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

The rule (F,F=>G)/G, where => means "implies," which is the sole rule of inference in propositional calculus. This rule states that if each of F and F=>G is either an axiom ...

A shuffle in which cards from the top of the deck in the left hand are alternatively moved to the bottom and top of the deck in the right hand. If the deck is shuffled m ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

The unique 1-polyomino, consisting of a single square.

A morphism f:Y->X in a category is a monomorphism if, for any two morphisms u,v:Z->Y, fu=fv implies that u=v. In the categories of sets, groups, modules, etc., a monomorphism ...