CMSC 56: DISCRETE MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE I BOOLEAN ALGEBRA AXIOMS Axiom 1 Axiom 2 Axiom 3 Axiom 4

SWITCHING ALGEBRA Logic Gates NOT Gate a a 0 1 1 0 AND Gate a 0 0 1 1 OR Gate a 0 0 1 1 NAND Gate a 0 0 1 1 NOR Gate a 0 0 1 1 XOR Gate 1+0=1 1+ 1 = 1 a 0 0 1 1 b ab 0 0 1 1 0 1 1 0 b a||b 0 1 1 0 0 0 1 0 b a|b 0 1 1 1 0 1 1 0 b a+b 0 0 1 1 0 1 1 1 b ab 0 0 1 0 0 0 1 1

Closure Commutative Law Distributive Law Identity Law

Axiom 5

Complementary Law

a+b, ab, a B a+b = a+b ab = ab a(b+c) = ab+ac a+(bc) = (a+b) (a+c) a+0 = a a1 = a where 0 and 1 are distinct and unique a+a = 1. a is unique aa = 0

THEOREMS OF BOOLEAN ALGEBRA Theorem 1 Associative Theorem 2 Theorem 3 Theorem 4 Theorem 5 Theorem 6 Idempotency Dominance Double Complement Absorption De Morgans

a+(b+c) = (a+b)+c a(bc) = (ab) c a+a = a aa = a a+1 = 1 a0 = 0 (a) = a a+(ab) = a a(a+b) = a (ab) = a+b (a+b) = ab

BOOLEAN OPERATIONS Boolean Complement ( ) 0 = 1 1 = 0 Boolean Product ( ) 00=0 01=0

Boolean Sum (+) 0+0=0 0+1= 10=0 11=1