Skip to content
Official PYQ · 1992

GATE CS 1992 Q92 — Propositional and First Order Logic

Explain with AI

Which of the following predicate calculus statements is/are valid?

Choose one option
View worked solution

Answer: A

A predicate calculus statement is valid if it is true under all possible interpretations.

Let's analyze the options:

  • Option A: (∀x)P(x)∨(∀x)Q(x)  ⟹  (∀x)(P(x)∨Q(x))(\forall x) P(x) \vee (\forall x) Q(x) \implies (\forall x) (P(x) \vee Q(x))
    If the antecedent (∀x)P(x)∨(∀x)Q(x)(\forall x) P(x) \vee (\forall x) Q(x) is true, then either P(x)P(x) is true for all xx, or Q(x)Q(x) is true for all xx. In either case, every element xx satisfies P(x)∨Q(x)P(x) \vee Q(x). Thus, the consequent (∀x)(P(x)∨Q(x))(\forall x) (P(x) \vee Q(x)) is always true. This statement is valid.
  • Options B & C: Consider a domain D={1,2}D = \{1, 2\} where P(1)P(1) is true, P(2)P(2) is false, Q(1)Q(1) is false, and Q(2)Q(2) is true. Here, (∃x)P(x)∧(∃x)Q(x)(\exists x) P(x) \wedge (\exists x) Q(x) is true but (∃x)(P(x)∧Q(x))(\exists x) (P(x) \wedge Q(x)) is false (disproving B). Similarly, (∀x)(P(x)∨Q(x))(\forall x) (P(x) \vee Q(x)) is true but (∀x)P(x)∨(∀x)Q(x)(\forall x) P(x) \vee (\forall x) Q(x) is false (disproving C).
  • Option D: Consider a domain D={1}D = \{1\} where P(1)P(1) is true and Q(1)Q(1) is false. The antecedent (∃x)(P(x)∨Q(x))(\exists x) (P(x) \vee Q(x)) is true, but the consequent ∼(∀x)P(x)∨(∃x)Q(x)\sim (\forall x) P(x) \vee (\exists x) Q(x) is false. Thus, D is invalid.

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

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