Question

The CORRECT formula for the sentence, "not all rainy days are cold" is

Choose one option
Official answer and solution
Official answer
D
From
Official GATE 2014 answer key

Solution

Formulate the universal statement in first-order logic and negate it using standard equivalences.

  1. Let dd represent a day from the domain of all days.

    • Rainy(d)\text{Rainy}(d): "day dd is rainy"
    • Cold(d)\text{Cold}(d): "day dd is cold"
  2. The statement "All rainy days are cold" is formalized as:

    ∀d(Rainy(d)→Cold(d)).\forall d (\text{Rainy}(d) \to \text{Cold}(d)).
  3. The sentence "Not all rainy days are cold" is the direct logical negation:

    ¬∀d(Rainy(d)→Cold(d)).\neg \forall d (\text{Rainy}(d) \to \text{Cold}(d)).
  4. Apply Quantifier and Implication Negation:

    • Negating the universal quantifier yields an existential quantifier:
      ∃d¬(Rainy(d)→Cold(d)).\exists d \neg (\text{Rainy}(d) \to \text{Cold}(d)).
    • Since p→q≡¬p∨qp \to q \equiv \neg p \lor q, its negation is ¬(p→q)≡p∧¬q\neg (p \to q) \equiv p \land \neg q:
      ∃d(Rainy(d)∧∼Cold(d)).\exists d (\text{Rainy}(d) \land \sim\text{Cold}(d)).

This corresponds exactly to option D.

Final answer

D

Common trap

Translating 'not all' as 'all days are not cold' (universal quantifier with negation, option A).

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

Source

Paper
GATE 2014 Computer Science and Information Technology (CS) Session 3
Question
63 of 65, printed as CS Q.53
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.