CSC165H1 Lecture : tut03solution.pdf

• School: UTSG
• Department: Computer Science
• Course: CSC165H1
• Professor: Nathalie Fournier

Document Summary

This equivalence holds. (p q) (p r) ( p q) ( p r) P (q r) (implication) (distributivity) (implication) (b) (p r) (q r) (p q) r. Suppose p is true, q is false, and r is false. Then (p r) (q r) = (true false) (false false) = false but (p q) r = (true false) false. = true (c) p q (p q) ( p q) P q (p q) (q p ) ( p q) ( q p ) (cid:0)( p q) q(cid:1) (cid:0)( p q) p(cid:1) ( p q) (q q) ( p p ) (q p ) ( p q) (q p ) (p q) ( p q) (equivalence) (implication) (distributivity) (distributivity) (identity) (commutativity) Let d = {1, 2} and p (x, y): x < y. then, x d, y d, p (x, y) is false because p (2, 1) is false.