Question

Which one of the following predicate formulae is NOT logically valid? Note that WW is a predicate formula without any free occurrence of xx.

Choose one option
Official answer and solution
Official answer
C
From
Official GATE 2020 answer key

Solution

Evaluate equivalence of each predicate formula using standard quantifier distribution rules.

Given that WW contains no free occurrences of xx:

  • A: ∀x(p(x)∨W)≡∀x p(x)∨W\forall x (p(x) \lor W) \equiv \forall x\, p(x) \lor W. Since universal quantifier distributes over disjunction with a constant formula WW, this is logically valid.
  • B: ∃x(p(x)∧W)≡∃x p(x)∧W\exists x (p(x) \land W) \equiv \exists x\, p(x) \land W. Since existential quantifier distributes over conjunction with a constant formula WW, this is logically valid.
  • D: ∃x(p(x)→W)≡∃x(¬p(x)∨W)≡∃x¬p(x)∨W≡¬(∀x p(x))∨W≡(∀x p(x))→W\exists x (p(x) \to W) \equiv \exists x (\neg p(x) \lor W) \equiv \exists x \neg p(x) \lor W \equiv \neg (\forall x\, p(x)) \lor W \equiv (\forall x\, p(x)) \to W. This is logically valid.

Analysis of Formula C:

∀x(p(x)→W)≡∀x(¬p(x)∨W)≡∀x¬p(x)∨W≡¬(∃x p(x))∨W≡(∃x p(x))→W\forall x (p(x) \to W) \equiv \forall x (\neg p(x) \lor W) \equiv \forall x \neg p(x) \lor W \equiv \neg (\exists x\, p(x)) \lor W \equiv (\exists x\, p(x)) \to W
  • The correct equivalent of ∀x(p(x)→W)\forall x (p(x) \to W) is (∃x p(x))→W(\exists x\, p(x)) \to W, NOT (∀x p(x))→W(\forall x\, p(x)) \to W.
  • Counterexample: Suppose in domain D={1,2}D = \{1, 2\}, p(1)p(1) is true, p(2)p(2) is false, and WW is false.
    • LHS: ∀x(p(x)→W)\forall x (p(x) \to W) requires both p(1)→Wp(1) \to W (True →\to False = False) and p(2)→Wp(2) \to W (False →\to False = True) to hold. Their conjunction is False.
    • RHS: (∀x p(x))→W(\forall x\, p(x)) \to W. Since ∀x p(x)\forall x\, p(x) is False, False →\to False evaluates to True.
    • Since LHS ≠\ne RHS, formula C is NOT logically valid.
Final answer

C

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2020 Computer Science and Information Technology (CS)
Question
49 of 65, printed as CS Q.39
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.