Question

If X does not occur free in Q, then ∀X(P(X) -> Q) is semantically equivalent with∃XP(X)...

If X does not occur free in Q, then ∀X(P(X) -> Q) is semantically equivalent with∃XP(X) -> Q. Give an example to show that these formulas will not necessarily be equivalent if X does occur free in Q.

Homework Answers

Answer #1

Let M a structure whatever, with domain D.

Two cases :

(i) ∃xP(x) is False.

Thus ∃xP(x)→Q is True.

But to say that ∃xP(x) is False in M means that for a∈D whatever, we have that P(x)[a/x] is False, and thus (P(x)→Q)[a/x] is True in M.

And this means in turn that M⊨∀x(P(x)→Q).

And for the second case

(ii) ∃xP(x) is True, i.e. there is an object a∈D such that P(x)[a/x] is True.

Two sub-cases :

(a) Q is False. Thus ∃xP(x)→Q is False.

But (P(x)→Q)[a/x] is False for the a∈D above, and thus ∀x(P(x)→Q) is False in M.

(b) Q is True. Thus ∃xP(x)→Q is True.

But if Q is True, also (P(x)→Q)[a/x] is True, for a∈D whatever.

And this means that ∀x(P(x)→Q) is True in M.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Show the following are not logically equivalent: ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)).
Show the following are not logically equivalent: ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)).
Show that ∀xP (x) ∨ ∀xQ(x) ̸≡ ∀x [P (x) ∨ Q(x)] By defining a universe...
Show that ∀xP (x) ∨ ∀xQ(x) ̸≡ ∀x [P (x) ∨ Q(x)] By defining a universe of discourse and predicts P, Q over it such that one side of the expression evaluates to true and the other side evaluates to false.
Discrete mathematics counterexamples - Supplementary question: S1.) Give a counterexample to show that "∀x(p(x) --> Q(x))...
Discrete mathematics counterexamples - Supplementary question: S1.) Give a counterexample to show that "∀x(p(x) --> Q(x)) and ∀xP(x) --> ∀xQ(x)" may not be logically equivalent.
Is ∃x[P(x)∧Q(x)] equals ∃xP(x)∧∃yQ(y) ? Why? What is the relationship between them?
Is ∃x[P(x)∧Q(x)] equals ∃xP(x)∧∃yQ(y) ? Why? What is the relationship between them?
[16pt] Which of the following formulas are semantically equivalent to p → (q ∨ r): For...
[16pt] Which of the following formulas are semantically equivalent to p → (q ∨ r): For each formula from the following (denoted by X) that is equivalent to p → (q ∨ r), prove the validity of X « p → (q ∨ r) using natural deduction. For each formula that is not equivalent to p → (q ∨ r), draw its truth table and clearly mark the entries that result in the inequivalence. Assume the binding priority used in...
(1) Determine whether the propositions p → (q ∨ ¬r) and (p ∧ ¬q) → ¬r...
(1) Determine whether the propositions p → (q ∨ ¬r) and (p ∧ ¬q) → ¬r are logically equivalent using either a truth table or laws of logic. (2) Let A, B and C be sets. If a is the proposition “x ∈ A”, b is the proposition “x ∈ B” and c is the proposition “x ∈ C”, write down a proposition involving a, b and c that is logically equivalentto“x∈A∪(B−C)”. (3) Consider the statement ∀x∃y¬P(x,y). Write down a...
Prove equivalent: P⊃ (Q ⊃ P) and (~Q ⊃ (P ⊃ (~Q V P)))
Prove equivalent: P⊃ (Q ⊃ P) and (~Q ⊃ (P ⊃ (~Q V P)))
Consider the following predicate formulas. F1: ∀x ( P(x) → Q(x) ) F2: ∀x P(x) →...
Consider the following predicate formulas. F1: ∀x ( P(x) → Q(x) ) F2: ∀x P(x) → Q(x) F3: ∃x ( P(x) → Q(x) ) F4: ∃x P(x) → Q(x) For each of the following questions, answer Yes or No & Justify briefly . (a) Does F1 logically imply F2? (b) Does F1 logically imply F3? (c) Does F1 logically imply F4? (d) Does F2 logically imply F1?
Let T : P(R) → P(R) be the linear map defined by T(p(x)) = xp′(x) (you...
Let T : P(R) → P(R) be the linear map defined by T(p(x)) = xp′(x) (you may take it for granted that T is linear). Show that for each λ ∈ Z with λ ≥ 0, λ is an eigenvalue of T , and xλ is a corresponding eigenvector.
1. Construct a truth table for: (¬p ∨ (p → ¬q)) → (¬p ∨ ¬q) 2....
1. Construct a truth table for: (¬p ∨ (p → ¬q)) → (¬p ∨ ¬q) 2. Give a proof using logical equivalences that (p → q) ∨ (q → r) and (p → r) are not logically equivalent. 3.Show using a truth table that (p → q) and (¬q → ¬p) are logically equivalent. 4. Use the rules of inference to prove that the premise p ∧ (p → ¬q) implies the conclusion ¬q. Number each step and give the...