This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
Understand it in one breath
An algebra of relations between two logical values, true (1) and false (0). Boole's nineteenth-century system was extended by later logicians, and in 1937 Shannon showed how Boolean algebra could analyze and design relay switching circuits. A functionally complete gate such as NAND can express any finite Boolean function, although a physical computer also depends on timing, storage, devices, and architecture.
At a glance
A
B
A AND B
A OR B
A XOR B
NOT A
0
0
0
0
0
1
0
1
0
1
1
1
1
0
0
1
1
0
1
1
1
1
0
0
A truth table — just four input cases define every one of these logic gates.
Concept
An algebra of true/false relations, later connected by Shannon to switching-circuit design and now central to digital logic.
Key formula
a∧b=aˉ∨bˉ(De Morgan)
Ports in time
This concept was not invented in one instant
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
1
AD 1854Scene 1 / 4Continue through the world of this year
Boole — The Laws of Thought
Self-taught Irish mathematician George Boole published a system for calculating with logic as though it were algebra. It attracted little attention at the time.
No reliable place is given, so time continues without an invented pin
In his MIT master’s thesis at age 21, Claude Shannon showed that Boolean algebra could describe electrical switching circuits — one of the most influential master’s theses ever written.