Rules of Replacement (equivalent propositions) Any logically equivalent expressions can replace each other wherever they occur.

1. Idempotence P(PP) P(PP) 2. Commutativity (PQ)(QP) (PQ)(QP) 3. Associativity (PQ)RP(QR) (PQ)RP(QR) 4. De Morgans Laws ( P Q ) P Q ( P Q ) P Q 5. Distributivity of over P(QR) (PQ)(PR) 6. Distributivity of over P(QR) (PQ)(PR) 7. Double Negation PP 8. Material Implication ( P Q ) (P Q ) 9. Material Equivalence (PQ) ( P Q ) ( QP ) 10. Exportation (( P Q ) R ) ( P (Q R )) 11. Absurdity (( P Q ) ( P Q )) P 12. Contrapositive ( P Q ) ( Q P ) 13. Identity P11 P0P P P 1 P P 0 P1P P00 0 1 1 0

14. Absorption P(PR)P P(PR)P

Examples: 1. Simplify the proposition (( PQ ) ( PR )) ( Q R ) (( P Q ) ( P R )) ( Q R ) (( P P ) ( Q v R )) ( Q v R ) ( P ( QR )) ( Q R ) (P ( Q R )) ( Q R ) ( P ( Q R )) ( Q R ) ( P ( Q R )) (( Q R ) ( Q R )) ( P ( Q R )) 1 P(QR) MI Assoc. Idempotence MI Dem, DN Distributivity Identity Identity

2. On a rare TV game show, a young couple was shown three keys labeled A, B and C and was told that they could win a beautiful new home simply by picking the key which opened its front door. To help the couple make their decision, the EMCEE of the show gave them the following pieces of information: Either key A will open the door, or key B will not and key C will. If key B will not open the door then key C will. It is impossible that either both keys A and B will open the door or both keys A and C will. After a few minute-reflection the couple made the correct choice. Which key did the couple pick? Show a solution that uses a truth table. A B C A (B C) B C (( A B ) ( A C )) 1 0 0 1 0 1 0 1 0 0 1 1 0 0 1 1 1 1 Key C is the one chosen.