This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

BooleanConvert

BooleanConvert[expr]
converts the Boolean expression expr to disjunctive normal form.
BooleanConvert
converts the Boolean expression expr to the specified form.
BooleanConvert
finds an expression in the specified form that is equivalent to expr when cond is true.
  • Available forms are:
"DNF","SOP"disjunctive normal form, sum of products
"CNF","POS"conjunctive normal form, product of sums
"ESOP"exclusive sum of products
"ANF"algebraic normal form
"NOR"two-level Nor and Not
"NAND"two-level Nand and Not
"AND"two-level And and Not
"OR"two-level Or and Not
"IMPLIES"Implies and Not
"ITE","IF"If and constants
"BFF"BooleanFunction form
"BDT"Boolean decision tree
Convert a Boolean expression to disjunctive normal form:
Convert to some common forms:
Convert using the condition that is true:
Show that the output is equivalent to the input when :
Convert a Boolean expression to disjunctive normal form:
In[1]:=
Click for copyable input
Out[1]=
 
Convert to some common forms:
In[1]:=
Click for copyable input
Out[1]=
 
Convert using the condition that is true:
In[1]:=
Click for copyable input
Out[1]=
Show that the output is equivalent to the input when :
In[2]:=
Click for copyable input
Out[2]=
Convert a Boolean expression to different forms:
Disjunctive normal form:
Conjunctive normal form:
Exclusive sum of products:
Algebraic normal form:
Two-level Nand and Not:
Two-level Nor and Not:
Two-level And and Not:
Two-level Or and Not:
Implies and Not:
If and constants:
Boolean function form:
Boolean decision tree:
Show that they are all equivalent:
Convert a Boolean function using a "care set" or condition:
The resulting forms are equivalent when cond is true:
They are not equivalent without the condition:
Typically the forms are longer without conditions:
The output from BooleanConvert is equivalent to its input:
The output from BooleanConvert with condition is conditionally equivalent to its input:
The forms f and g are equivalent when cond is true:
They are not equivalent on their own:
Use BooleanMinimize to get the minimal length form:
The forms are equivalent:
New in 7