The BooleanSimplify command returns a minimal sum of products expansion of the given Boolean expression.

The expression returned is a minimal (irreducible) sum of prime implicants.

Note: BooleanSimplify does not guarantee that the returned expansion is a minimum sum of prime implicants.

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

$\mathrm{BooleanSimplify}\left(a\&ora\&andb\right)$

$a$

$\mathrm{BooleanSimplify}\left(a\&andb\&ora\&and\mathrm{`\&not`}\left(b\right)\right)$

$a$

$\mathrm{BooleanSimplify}\left(a\&iffa\&orb\right)$

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

$\mathrm{BooleanSimplify}\left(\mathrm{`\&or`}\left(a\&andb\,\mathrm{`\&not`}\left(a\right)\&andc\,b\&andc\right)\right)$

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