An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra,
 |
(1)
|
where 
denotes NOT and 
denotes OR. Taken together, the
three axioms consisting of (1), commutativity
 |
(2)
|
and associativity
 |
(3)
|
are equivalent to the axioms of Boolean algebra.
The Huntington operator can be defined in the Wolfram Language by:
Huntington := Function[{x, y}, ! (! x \[Or] y)
\[Or] ! (! x \[Or] ! y)]
That the Huntington axiom is a true statement in Boolean algebra can be verified by examining its truth table.
 |  |  |
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | F |
