Boolean Algebra Simplification Quiz

Choose the law that can be applied to simplify or rearrange the Boolean expression. OCR-style notation is used: V for OR, Ʌ for AND, and ¬ for NOT.

Current Expression

Inputs are limited to A, B and C. Each generated expression starts with at least three operands and needs at least two steps.

Step 0
Select a law to start simplifying.

Simplification History

Rules used in this quiz

This engine includes Identity, Idempotent, Complement, Double Negation, De Morgan’s Law, Absorption, Distribution, Associative Law and Commutative Law. The four options may include one or two valid routes, so students sometimes need to choose between simplifying immediately or rearranging first.