1. Math
  2. Advanced Math
  3. 13 working with a logical equivalency suppose we are trying...

Question: 13 working with a logical equivalency suppose we are trying...

Question details

13. Working with a Logical Equivalency. Suppose we are trying to prove the following for integers x and y: If x y is even, then x is even or y is even We notice that we can write this statement in the following symbolic form where P is х-y is even. Q is X seven,. and R is ..y is even. (a) Write the symbolic form of the contrapositive of P-(Q vR). Then use one of De Morgans Laws (Theorem 2.5) to rewrite the hypothesis of this conditional statement. (b) Use the result from Part (13a) to explain why the given statement is logically equivalent to the following statement: The two statements in this activity are logically equivalent. We now have the choice of proving either of these statements. If we prove one, we prove the other, or if we show one is false, the other is also false. The second statement is Theorem 1.8, which was proven in Section 1.2

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution