Proving the Equivalence of Boolean Equations - I


Truth Tables expose all the possible combinations of input values and thus all possible outputs. Thus a Truth Table is an ENUMERATIVE method of solution (proof).

PROBLEM:

Prove:

~A || A = T

A
~A
~A || A
0
1
1
1
0
1


This is called a "Tautology" - a statement that is always True!

[Prev][TOC][Next]

CS1104 Main Page
Last Updated 02/14/2000
© L.Heath, 2000, updated by J.A.N. Lee, 2000/02/10