Boolean Algebra Calculator

Simplify boolean expressions step by step

The calculator will try to simplify/minify the given boolean expression, with steps when possible. Applies commutative law, distributive law, dominant (null, annulment) law, identity law, negation law, double negation (involution) law, idempotent law, complement law, absorption law, redundancy law, de Morgan's theorem. Supports all basic logic operators: negation (complement), and (conjunction), or (disjunction), nand (Sheffer stroke), nor (Peirce's arrow), xor (exclusive disjunction), implication, converse of implication, nonimplication (abjunction), converse nonimplication, xnor (exclusive nor, equivalence, biconditional), tautology (T), and contradiction (F).

It will also find the disjunctive normal form (DNF), conjunctive normal form (CNF), and negation normal form (NNF).

Related calculator: Truth Table Calculator

If the calculator did not compute something or you have identified an error, or you have a suggestion/feedback, please write it in the comments below.

Your Input

Simplify the boolean expression $$$\overline{\left(\overline{A} + B\right) \cdot \left(\overline{B} + C\right)}$$$.


Apply de Morgan's theorem $$$\overline{X \cdot Y} = \overline{X} + \overline{Y}$$$ with $$$X = \overline{A} + B$$$ and $$$Y = \overline{B} + C$$$:

$${\color{red}\left(\overline{\left(\overline{A} + B\right) \cdot \left(\overline{B} + C\right)}\right)} = {\color{red}\left(\overline{\overline{A} + B} + \overline{\overline{B} + C}\right)}$$

Apply de Morgan's theorem $$$\overline{X + Y} = \overline{X} \cdot \overline{Y}$$$ with $$$X = \overline{A}$$$ and $$$Y = B$$$:

$${\color{red}\left(\overline{\overline{A} + B}\right)} + \overline{\overline{B} + C} = {\color{red}\left(\overline{\overline{A}} \cdot \overline{B}\right)} + \overline{\overline{B} + C}$$

Apply the double negation (involution) law $$$\overline{\overline{X}} = X$$$ with $$$X = A$$$:

$$\left({\color{red}\left(\overline{\overline{A}}\right)} \cdot \overline{B}\right) + \overline{\overline{B} + C} = \left({\color{red}\left(A\right)} \cdot \overline{B}\right) + \overline{\overline{B} + C}$$

Apply de Morgan's theorem $$$\overline{X + Y} = \overline{X} \cdot \overline{Y}$$$ with $$$X = \overline{B}$$$ and $$$Y = C$$$:

$$\left(A \cdot \overline{B}\right) + {\color{red}\left(\overline{\overline{B} + C}\right)} = \left(A \cdot \overline{B}\right) + {\color{red}\left(\overline{\overline{B}} \cdot \overline{C}\right)}$$

Apply the double negation (involution) law $$$\overline{\overline{X}} = X$$$ with $$$X = B$$$:

$$\left(A \cdot \overline{B}\right) + \left({\color{red}\left(\overline{\overline{B}}\right)} \cdot \overline{C}\right) = \left(A \cdot \overline{B}\right) + \left({\color{red}\left(B\right)} \cdot \overline{C}\right)$$


$$$\overline{\left(\overline{A} + B\right) \cdot \left(\overline{B} + C\right)} = \left(A \cdot \overline{B}\right) + \left(B \cdot \overline{C}\right)$$$