A.0 =
A.0 = 0
A.1 =
A.1 = A
A.A =
A.A = A
A+0 =
A+0 = A
A+1 =
A+1 = 1
A+A =
A+A = A
A+A’ =
A+A’ = 1
A.A’ =
A.A’ = 0
A’’ =
A’’ = A
A.B =
A.B = B.A
A+B =
A+B = B+A
A.(B.C)
A.(B.C) = (A.B).C
A+(B+C)
A+(B+C) = (A+B)+C
A.(B+C)
A.(B+C) = A.B+A.C
(A+B).(C+D)
(A+B).(C+D) = A.C+A.D+B.C+B.D
A+(A.B)
A+(A.B) = A
A.(A+B)
A.(A+B) = A
State the two S’s of De Morgan’s Law
Split and Switch
State De Morgan’s Law first law
____ __ __
A + B = A . B
State De Morgan’s Law second law
____ __ __
A . B = A + B
What is Boolean algebra used for?
It’s used to represent logical expressions in a truth table.