The Canonicalize command converts the given boolean expression to a canonical form.

The canonical form used is determined by the form=fname option. The default value for this option is DNF.

The canonical form is given with respect to the names given in alpha.  Note that alpha is necessary when the form chosen is CNF or DNF.

The following is a list of available canonical forms.

MOD2  - The Boolean expression is converted to its equivalent modulo 2 canonical form.

CNF - The conjunctive normal form is returned.

DNF - The disjunctive normal form is returned.

$\mathrm{with}\left(\mathrm{Logic}\right)\:$

$\mathrm{Canonicalize}\left(a\&andb\,\left\{a\,b\,c\right\}\right)$

$\left(a\wedge b\wedge c\right)\vee \left(a\wedge b\wedge \left(\neg c\right)\right)$

$\mathrm{Canonicalize}\left(a\&xorb\,\mathrm{form}=\mathrm{MOD2}\right)$

$a+b$

$\mathrm{Canonicalize}\left(a\&xorb\,\left\{a\,b\right\}\,\mathrm{form}=\mathrm{CNF}\right)$

$\left(a\vee b\right)\wedge \left(\left(\neg a\right)\vee \left(\neg b\right)\right)$

$\mathrm{Canonicalize}\left(a\&xorb\,\left\{a\,b\right\}\,\mathrm{form}=\mathrm{DNF}\right)$

$\left(a\wedge \left(\neg b\right)\right)\vee \left(b\wedge \left(\neg a\right)\right)$