GATE CS 2025 (Forenoon) — Question 48

Discrete MathematicsPropositional and First-Order Quantifier LogicMSQ2 marksHard

Which of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: “Everyone has exactly one mother”? The meanings of the predicates used are: • \( \text{mother}(y, x) \): \( y \) is the mother of \( x \) • \( \text{noteq}(x, y) \): \( x \) and \( y \) are not equal
  1. A
    \( \forall x \exists y \exists z (\text{mother}(y, x) \land \neg\text{mother}(z, x)) \)
  2. B
    \( \forall x \exists y [\text{mother}(y, x) \land \forall z (\text{noteq}(z, y) \rightarrow \neg\text{mother}(z, x))] \)
  3. C
    \( \forall x \forall y [\text{mother}(y, x) \rightarrow \exists z (\text{mother}(z, x) \land \neg\text{noteq}(z, y))] \)
  4. D
    \( \forall x \exists y [\text{mother}(y, x) \land \neg\exists z (\text{noteq}(z, y) \land \text{mother}(z, x))] \)
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDiscrete Mathematics and Its Applications (Rosen)Logic, sets, relations, combinatorics and graph theory, with worked examples.
Practise more on Propositional and First-Order Quantifier LogicTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group