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
Solution
Apply de Morgan's theorem x⋅y=x+y with x=A+B and y=B+C:
((A+B)⋅(B+C))=(A+B+B+C)Apply de Morgan's theorem x+y=x⋅y with x=A and y=B:
(A+B)+B+C=(A⋅B)+B+CApply the double negation (involution) law x=x with x=A:
((A)⋅B)+B+C=((A)⋅B)+B+CApply de Morgan's theorem x+y=x⋅y with x=B and y=C:
(A⋅B)+(B+C)=(A⋅B)+(B⋅C)Apply the double negation (involution) law x=x with x=B:
(A⋅B)+((B)⋅C)=(A⋅B)+((B)⋅C)
Answer
(A+B)⋅(B+C)=(A⋅B)+(B⋅C)