What is Boolean algebra?
Boolean algebra is a branch of mathematics that deals with variables that can only take two values: true/false, 1/0, or on/off. It was introduced by George Boole in 1854 and became the mathematical foundation of every digital circuit, processor, and computer program ever built.
Unlike ordinary algebra, where variables can take any number, Boolean variables are binary. This restriction is exactly what makes Boolean algebra so useful for describing electronic switches and logic gates — a wire is either carrying current (1) or it isn't (0).
The three core operations
Every Boolean expression can be built from three fundamental operations:
- AND (·) — the result is 1 only when both operands are 1. Example: A·B.
- OR (+) — the result is 1 when at least one operand is 1. Example: A+B.
- NOT (¬ or overline) — flips the value: 0 becomes 1 and 1 becomes 0.
Basic laws
A handful of laws let you simplify any expression without building a truth table from scratch:
- Identity: A·1 = A, A+0 = A
- Null: A·0 = 0, A+1 = 1
- Idempotent: A·A = A, A+A = A
- Complement: A·¬A = 0, A+¬A = 1
- Commutative: A·B = B·A, A+B = B+A
- Distributive: A·(B+C) = A·B + A·C
Why it matters for circuit design
Every logic gate in Boolflow — AND, OR, XOR, NAND, NOR — is a direct physical implementation of a Boolean operation. When you place gates and wire them together in the editor, you are literally building a Boolean expression in hardware. Simplifying that expression with the laws above means fewer gates, less wiring, and a cheaper, faster circuit.
Once you have an expression, the next natural step is verifying it against a truth table and, when you are happy with the design, exporting it straight to Verilog, VHDL, or C++.