SwitchingAlgebra.docVIP

Switching Algebra Logic What is a logical argument? an argument that is true by virtue of its form; i.e. if premises true conclusion must be true Positive example P1) All men are mortal P2) Harry is a man ----------------- C) Therefore, Harry is mortal Negative examples P1) If I study hard in 200, I will get an A. P2) I got an A in 200. ------------------ C) Therefore, I studied hard. P1) Katz believes that 200 is easy. P2) Katz is a dufus. ------------------- C) Therefore, 200 is difficult. In the mid-19th century, Boole formalized logic. We will be studying a subset of formal logic known as the propositional calculus.  Switching Algebra Axioms of the propositional calculus (1) All variables must take one of the values 0 or 1 (2) Rules for not X X’ ----------- 0 1 1 0 (3) Rules for and X Y X · Y ---------------------- 0 0 0 0 1 0 1 0 0 1 1 1 (4) Rules for or X Y X + Y ------------------------ 0 0 0 0 1 1 1 0 1 1 1 1  Switching Algebra Theorems of the propositional calculus theorem dual name (T1) X + 0 = X X · 1 = X identity (T2) X + 1 = 1 X · 0 = 0 null elements (T3) X + X = X X · X = X idempotency (T4) (X’)’ = X (X’)’ = X involution (T5) X + X’ = 1 X · X’ = 0 complement (T6) X + Y = Y + X X · Y = Y · X commutativity (T7) (X + Y) + Z = X + (Y + Z) (X + Y) + Z = X + (Y + Z) associativity (T8) X · Y + X · Z = X · (Y + Z) (X + Y) · (X + Z) = X + Y · Z distributivity (T9) (X · Y)’ = X’ + Y’ (X + Y)’ = X’ · Y’ DeMorgan’s Proof by truth table Fact All theorems of the pc can be proven with a truth table, i.e., by systematically examining every case and showing that the theorem hold for these cases (this method also is known as perfect induction). Examples Prove (T5): X X’ X + X’ 0 1 1 1 0 1 Prove the dual of (T9): X Y X + Y (X + Y)’ X’ Y’ X’ · Y’ 0 0 0