[Chapter 1] Boolean Logic

Truth Table Representation : The simplest way to specify a Boolean function is to
enumerate all the possible values of the function’s input variables, along with the
function’s output for each set of inputs. This is called the truth table.

 

Canonical Representation : As it turns out, every Boolean function can be expressed
using at least one Boolean expression called the canonical representation.
ex) If x*ybar*zbar and x*y*zbar are true, the canoninal representation of the boolean function is f(x,y,z) = x*ybar*zbar + x*y*zbar.

 

Interesting Point :
The Nand function (as well as the Nor function) has an interesting theoretical property: Each one of the operations And, Or, and Not can be constructed from it, and it alone(e.g, x Or y  = (x Nand x) Nand (y Nand y)).