I have a set of questions below that I'm trying to logically work my way through. I have ideas about each but I'm not sure if I'm correct. Any advice would be most welcome! Thanks so much!
1) I know that the converse is not true because there exists a Y not all Y. I don't know how to write out the converse though. 2) I believe they differ in meaning because the ∀x [P(x)]∨ ∀x [Q(x)] could have two different possible values for x. I'm not sure of a good example of that though. 3) would be similar to #2 where the first half could have two different values for X. Also not sure of an example. 4) I'm not sure at all about this one. I believe they are equivalent because the domain is not changing.
- (6) Explain why [∀y∀x P(x, y)] → [∀x∃y P(x, y)]. Use a counterexample to demonstrate that the converse is not always true.
- (4) How do ∀x [P(x)∨Q(x)] and ∀x [P(x)]∨ ∀x [Q(x)] differ in their meaning? Use examples to illustrate.
- (4) How do [∀x P(x)] → [∀x Q(x)] and ∀x [P(x) → Q(x)] differ in their meaning? Use examples to illustrate.
- (4) Are ∀x [P(x) → ∃y [Q(x, y)]] and ∀x∃y [P(x) → Q(x, y)] logically equivalent? Explain why or why not.
In finding examples, it is often useful to restrict $P$ and $Q$ to some set. For example: $P(x) \equiv (x \in \Bbb N \implies 2\mid x)$.