Question

Which one of the following is NOT logically equivalent to ¬∃x(∀y(α)∧∀z(β))\neg \exists x (\forall y (\alpha) \land \forall z (\beta))?

Choose one option
Official answer and solution
Official answer
Marks to all
From
Official GATE 2013 answer key
Why the marks went to every candidate

Official GATE answer key awarded Marks to All for this question.

Solution

Simplify the given predicate logic formula using standard equivalences and identify non-equivalent options.

The given expression is:

¬∃x(∀y(α)∧∀z(β))\neg \exists x (\forall y (\alpha) \land \forall z (\beta))

Pushing the outer negation inside the existential quantifier:

≡∀x¬(∀y(α)∧∀z(β))\equiv \forall x \neg (\forall y (\alpha) \land \forall z (\beta))

Applying De Morgan's law:

≡∀x(¬∀y(α)∨¬∀z(β))\equiv \forall x (\neg \forall y (\alpha) \lor \neg \forall z (\beta))
≡∀x(∃y(¬α)∨∃z(¬β))\equiv \forall x (\exists y (\neg \alpha) \lor \exists z (\neg \beta))

Let P=∃y(¬α)P = \exists y (\neg \alpha) and Q=∃z(¬β)Q = \exists z (\neg \beta). Then ¬P≡∀y(α)\neg P \equiv \forall y (\alpha) and ¬Q≡∀z(β)\neg Q \equiv \forall z (\beta).
The matrix inside the quantifier is P∨QP \lor Q.
Using the conditional equivalence p∨q≡¬p→q≡¬q→pp \lor q \equiv \neg p \rightarrow q \equiv \neg q \rightarrow p:

  • ¬P→Q\neg P \rightarrow Q gives: ∀x(∀y(α)→∃z(¬β))\forall x (\forall y (\alpha) \rightarrow \exists z (\neg \beta)). This matches Option (C).
  • ¬Q→P\neg Q \rightarrow P gives: ∀x(∀z(β)→∃y(¬α))\forall x (\forall z (\beta) \rightarrow \exists y (\neg \alpha)). This matches Option (B).

Now examine options (A) and (D):

  • Option (A): ∀x(∃z(¬β)→∀y(α))≡∀x(Q→¬P)≡∀x(¬Q∨¬P)\forall x (\exists z (\neg \beta) \rightarrow \forall y (\alpha)) \equiv \forall x (Q \rightarrow \neg P) \equiv \forall x (\neg Q \lor \neg P). This is NOT logically equivalent to P∨QP \lor Q.
  • Option (D): ∀x(∃y(¬α)→∃z(¬β))≡∀x(P→Q)≡∀x(¬P∨Q)\forall x (\exists y (\neg \alpha) \rightarrow \exists z (\neg \beta)) \equiv \forall x (P \rightarrow Q) \equiv \forall x (\neg P \lor Q). This is ALSO NOT logically equivalent to P∨QP \lor Q.

Because the question asks for which statement is NOT logically equivalent, and both (A) and (D) are not equivalent, there was no single unique correct option. As a result, GATE officially awarded Marks to All.

Final answer

Marks to All

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

Source

Paper
GATE 2013 Computer Science and Information Technology (CS)
Question
47 of 65, printed as CS Q.47
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.