Learn Boolean algebra interactively with visual examples. Master Boolean laws, theorems, and circuit simplification techniques using Karnaugh maps.
Boolean algebra is the mathematical foundation for digital logic design. It deals with variables that can have only two values: 0 (false) and 1 (true).
A + 0 = A
A · 1 = A
A + 1 = 1
A · 0 = 0
A + A = A
A · A = A
A + A' = 1
A · A' = 0
(A + B)' = A' · B'
(A · B)' = A' + B'
A + (B · C) = (A + B) · (A + C)
A · (B + C) = (A · B) + (A · C)
| A | B | A·B | A+B | A' |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 |
Enter a Boolean expression using variables A, B, C, D and operators +, ·, ', (, )
Toggle variables to see how the expression evaluates:
Expression: 0
Expression: 0
Expression: 0
Enter an expression to generate its truth table: