switching algebra

the basic postulate of switching algebra is the existence of a two-valued switching variable that can take either of two distinct values, 0 and 1. precisely stated, if $\text{[math]}$ is a switching variable then
$\text{[math]}$ these values are often referred to as the truth values of $\text{[math]}$ .

a switching algebra is an algebraic system consisting of the set $\text{[math]}$ , two binary operation called OR and AND, denoted by the symbols + and · respectively, and one unary operation called NOT, denoted by a prime.

[cite:@kohavi_switching_2010 section 3 switching algebra and its applications]