Question
Show that $\exists x P(x) \wedge \exists x Q(x)$ and $\exists x(P(x) \wedge Q(x))$ are not logically equivalent.
Step 1
We have two elements in our domain: Y and Z. We define P(Y) as False, Q(Y) as True, P(Z) as True, and Q(Z) as False. Show more…
Show all steps
Your feedback will help us improve your experience
Clarissa Noh and 70 other Calculus 2 / BC educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that $\exists x(P(x) \vee Q(x))$ and $\exists x P(x) \vee \exists x Q(x)$ are logically equivalent.
The Foundations: Logic and Proofs
Predicates and Quantifiers
Show that $\forall x P(x) \vee \forall x Q(x)$ and $\forall x(P(x) \vee Q(x))$ are not logically equivalent.
Which of is logically equivalent to $\neg(\forall x \exists y P(x, y)) ?$ Explain. $$ \exists x \exists y \rightarrow P(x, y) $$
Sets and Logic
Nested Quantifiers
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD