# Boolean logic

Boolean logic can be shown to be "embedded" in integer arithmetic (modulo 2) by assigning polynomials to logical connectives, like so: $NOT(x) = 1 - x, \quad AND(x,y) = x y, \quad OR(x,y) = x + y - x y.$