Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Boolean Computation > Disjunction >
Mathematica > Mathematics and Algorithms > Logic & Boolean Algebra > Boolean Computation > Disjunction >
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Programming > Boolean Computation > Disjunction >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

Disjunction

Disjunction
gives the disjunction of expr over all choices of the Boolean variables .
MORE INFORMATION
  • Disjunction applies Or to the results of substituting all possible combinations of True and False for the in expr.
EXAMPLESCLOSE ALL
Basic Examples   (3)
The disjunction over a set of variables:
Check whether an expression is satisfiable:
Find the conditions on a for to be satisfiable:
The disjunction over a set of variables:
In[1]:=
Click for copyable input
Out[1]=
 
Check whether an expression is satisfiable:
In[1]:=
Click for copyable input
Out[1]=
 
Find the conditions on a for to be satisfiable:
In[1]:=
Click for copyable input
Out[1]=
Properties & Relations   (5)
Disjunction effectively computes the Or over all truth values of the listed variables:
Disjunction is typically more efficient and can work large numbers of variables:
Disjunction eliminates (Exists) quantifiers for the list of variables:
Use Resolve to eliminate more general combinations of quantifiers:
SatisfiableQ is Disjunction over all variables:
Use Conjunction to compute And over a list of variables:
Conjunction is related to Disjunction by de Morgan's law:
Disjunction is effectively repeated Or, just as Sum is repeated Plus:
Represent Disjunction in terms of Sum:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF