WOLFRAM

Wolfram Language & System Documentation Center

BooleanConvert[expr]

converts the Boolean expression expr to disjunctive normal form.

BooleanConvert[expr,form]

converts the Boolean expression expr to the specified form.

BooleanConvert[expr,form,cond]

finds an expression in the specified form that is equivalent to expr when cond is true.

Details and Options
Details and Options Details and Options
Examples  
Basic Examples  
Scope  
Properties & Relations  
Neat Examples  
See Also
Related Guides
History
Cite this Page

BooleanConvert

BooleanConvert[expr]

converts the Boolean expression expr to disjunctive normal form.

BooleanConvert[expr,form]

converts the Boolean expression expr to the specified form.

BooleanConvert[expr,form,cond]

finds an expression in the specified form that is equivalent to expr when cond is true.

Details and Options

  • BooleanConvert[expr,form] will produce an expression equivalent to expr.
  • 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
    "BinaryNOR", "NOR2"two-argument Nor
    "BinaryNAND", "NAND2"two-argument Nand
    "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
  • The expression expr can contain any Boolean or logical functions, including BooleanFunction, BooleanCountingFunction, etc.
  • BooleanConvert[bf,form] converts the internal form of a pure BooleanFunction object.
  • BooleanConvert supports a Method option that specifies the detailed method to use.

Examples

open all close all

Basic Examples  (3)

Convert a Boolean expression to disjunctive normal form:

Convert x⊻y to some common forms:

Convert x⊻y⊻z using the condition that x∧(y∨z) is true:

Show that the output is equivalent to the input when x∧(y∨z):

Scope  (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-argument Nand:

Two-argument Nor:

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:

Properties & Relations  (3)

The output from BooleanConvert is equivalent to its input: