Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 1 - Section 1.4 - Predicates and Quantifiers - Exercises - Page 56: 48

Answer

Logical Equivalences: $$p\rightarrow q \equiv \neg p \lor q$$ a) $ A\rightarrow \forall x P(x)$ is logically equivalent with $\neg A \lor (\forall x P(x))$ by above Logical Equivalence. By previous exercise, this is logically equivalent to $$\forall x(\neg A \lor P(x)$$ which is again equivalent ,by above stated Logical equivalence, to $$\forall x(A \rightarrow P(x)$$ And thus $ A\rightarrow \forall x P(x) \equiv \forall x(A \rightarrow P(x))$ b) $ A\rightarrow \exists x P(x)$ is logically equivalent with $\neg A \lor (\exists x P(x))$ by above Logical Equivalence. By previous exercise 46, this is logically equivalent to $$\exists x(\neg A \lor P(x)$$ which is again equivalent ,by above stated Logical equivalence, to $$\exists x(A \rightarrow P(x)$$ And thus $ A\rightarrow \exists x P(x) \equiv \exists x(A \rightarrow P(x))$

Work Step by Step

See Answer
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.