Search Results for ""

Two sets A_1 and A_2 are disjoint if their intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i ...

The term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...

A disjunctive syllogism is a valid argument form in propositional calculus, where p and q are propositions: (p v q; ¬p)/(∴q). For example, if someone is going to study law or ...

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

A proof based on a dissection which shows the formula for the area of a plane figure or of the volume of a solid. Dozens of different dissection proofs are known for the ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

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

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

The ending of a game in which neither of two players wins, sometimes also called a "tie." A game in which no draw is possible is called a categorical game.

A term in social choice theory meaning each alternative receives equal weight for a single vote.