Boolean algebra operates on true (1) and false (0). AND: both true → true. OR: either true → true. NOT: flips value. De Morgan's laws: NOT(A AND B) = NOT A OR NOT B, and NOT(A OR B) = NOT A AND NOT B. These rules simplify digital circuit design.
How to Use
Enter a boolean expression:
- Variables: A, B, C, D
- Operators: AND(∧), OR(∨), NOT(¬)
- Result: Truth table generated
Key Laws
- De Morgan's: ¬(A∧B) = ¬A∨¬B
- Double negation: ¬¬A = A
- Absorption: A∨(A∧B) = A
- Identity: A∧1 = A, A∨0 = A
Logic Gates
- AND gate: output 1 only if all inputs 1
- OR gate: output 1 if any input 1
- NAND: NOT AND (universal gate)
- XOR: exclusive or (odd 1s)
Step-by-Step Instructions
- 1Enter variables (A, B).
- 2Set AND/OR values.
- 3View the truth table.
- 4Check simplified form.
- 5See De Morgan's equivalents.