Proofs in Switching Algebra
a b c ab ac b+c a(b+c) ab+ac
0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 1 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1
proof by perfect induction
The axioms state what we know about switches
All theorems follow from the axioms
Example: distributive law a ( b + c ) = a • b + a • c