Question

Which one of the following well formed formulae is a tautology?

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

Solution

Evaluate each predicate logic formula across universal interpretations.

Analyze each option:

  • (A) ∀x∃yR(x,y)↔∃y∀xR(x,y)\forall x \exists y R(x, y) \leftrightarrow \exists y \forall x R(x, y): False in general (∃y∀xR(x,y)  ⟹  ∀x∃yR(x,y)\exists y \forall x R(x, y) \implies \forall x \exists y R(x, y), but the converse does not hold).
  • (B) (∀x[∃yR(x,y)→S(x,y)])→∀x∃yS(x,y)(\forall x [\exists y R(x, y) \rightarrow S(x, y)]) \rightarrow \forall x \exists y S(x, y): False when R(x,y)R(x, y) is identically false and S(x,y)S(x, y) is identically false (antecedent is vacuously true, consequent is false).
  • (C) [∀x∃y(P(x,y)→R(x,y))]↔[∀x∃y(¬P(x,y)∨R(x,y))][\forall x \exists y (P(x, y) \rightarrow R(x, y))] \leftrightarrow [\forall x \exists y (\neg P(x, y) \lor R(x, y))]:
    By the classical material implication equivalence, A→B≡¬A∨BA \rightarrow B \equiv \neg A \lor B holds identically for all truth values.
    Since P(x,y)→R(x,y)P(x, y) \rightarrow R(x, y) and ¬P(x,y)∨R(x,y)\neg P(x, y) \lor R(x, y) denote identical relations in every interpretation, the quantified expressions have identical truth values in every model.
    Hence, the biconditional is a valid tautology.
  • (D) ∀x∀yP(x,y)→∀x∀yP(y,x)\forall x \forall y P(x, y) \rightarrow \forall x \forall y P(y, x): While true, option C is the standard structural equivalence tautology.
Final answer

C

Common trap

Assuming the quantifier reversal in option A is bidirectional.

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

Source

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