Skip to content
Official PYQ · 2015

GATE CS 2015 Set 2 Q55 — Propositional and First Order Logic

Explain with AI

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

Choose one option
View worked solution

Answer: C

To determine which well-formed formula is a tautology, we can analyze the options:

  • Option C: The material implication equivalence states that for any propositions AA and BB, A→B≡¬A∨BA \rightarrow B \equiv \neg A \lor B. Applying this equivalence to the predicate terms: P(x,y)→R(x,y)≡¬P(x,y)∨R(x,y)P(x,y) \rightarrow R(x, y) \equiv \neg P(x, y) \lor R(x, y) Since the inner formulas are logically equivalent, applying the same quantifiers ∀x ∃y\forall x \, \exists y to both sides preserves this equivalence: ∀x ∃y (P(x,y) → R(x,y))≡∀x ∃y(¬P(x,y) ∨R(x,y))\forall x \, \exists y \, \left( P(x,y) \, \rightarrow \, R(x, y) \right) \equiv \forall x \, \exists y \left(\neg P(x, y) \, \lor R(x, y) \right) Since both sides of the bi-conditional (↔\leftrightarrow) are logically equivalent, the entire formula is always true (a tautology).
  • Option D: The formula ∀x ∀y P(x,y)\forall x \, \forall y \, P(x,y) asserts that the predicate PP holds for all pairs in the domain. Swapping the variable names does not change this meaning, so ∀x ∀y P(x,y)≡∀x ∀y P(y,x)\forall x \, \forall y \, P(x,y) \equiv \forall x \, \forall y \, P(y,x). Thus, Option D is also a tautology (both C and D were accepted as correct in the official GATE key).
  • Option A: ∀x ∃y R(x,y)→∃y ∀x R(x,y)\forall x \, \exists y \, R(x,y) \rightarrow \exists y \, \forall x \, R(x,y) is not generally valid (e.g., "every person has a mother" does not imply "there is a single person who is the mother of everyone").
  • Option B: The scope of the existential quantifier ∃y\exists y in the antecedent is restricted to R(x,y)R(x,y), leaving yy in S(x,y)S(x,y) free, which does not logically imply the consequent.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Propositional and First Order Logic questions