Abstract Algebra: Theory and Applications

A Boolean or switching function on $n$ variables is a map $f:\{O,I{\}}^n\to \{0,I\}\text{.}$ A Boolean polynomial is a special type of Boolean function: it is any type of Boolean expression formed from a finite combination of variables $x_1,\dots ,x_n$ together with $O$ and $I\text{,}$ using the operations $\vee \text{,}$ $\wedge \text{,}$ and ${}^{\prime }\text{.}$ The values of the functions are defined in Table 19.34. Write a program to evaluate Boolean polynomials.