edited by
8,227 views
38 votes
38 votes

The CORRECT formula for the sentence, "not all Rainy days are Cold" is

  1. $\forall d (\text{Rainy}(d) \wedge \text{~Cold}(d))$
  2. $\forall d ( \text{~Rainy}(d) \to \text{Cold}(d))$
  3. $\exists d(\text{~Rainy}(d) \to \text{Cold}(d))$
  4. $\exists d(\text{Rainy}(d) \wedge \text{~Cold}(d))$
edited by

11 Answers

Best answer
48 votes
48 votes

Not all rainy days are cold.

In other words it says $``\text{Some rainy days are not cold"}$

Given statement is
$\neg \forall d[R(d)\to C(d)]$
$\equiv \neg \forall d[\neg R(d) \vee C(d)]$
$\equiv \exists d[R(d)\wedge \neg C(d)]$
Hence option (D) is correct.

edited by
27 votes
27 votes
  1. No rainy days are cold
  2. All non-rainy days are cold
  3. Some non-rainy days are cold.
  4. Some rainy days are not cold.


Option $D$.

edited by
14 votes
14 votes

Try this way

NOT (all rainy days are cold)

~($\forall$d Rainy(d)->Cold(d))

~($\forall$ ~Rainy(d) $\vee$cold(d))

$\exists$d( Rainy (d) $\wedge$~Cold(d))

OPTION D

edited by
6 votes
6 votes

not all rainy days are cold : meaning "there are some rainy days which are cold" = "some days are rainy and not cold".

∃d{R(d) \scriptstyle \wedge ¬C(d)}

ans = option D

Answer:

Related questions

11.0k
views
5 answers
53 votes
go_editor asked Sep 28, 2014
11,022 views
Consider the following statements:P: Good mobile phones are not cheapQ: Cheap mobile phones are not goodL: P implies QM: Q implies PN: P is equivalent to QWhich one of the ... is TRUE.Only M is TRUE.Only N is TRUE.L, M and N are TRUE.
17.1k
views
7 answers
43 votes
go_editor asked Sep 28, 2014
17,114 views
Consider the following relational schema:employee (empId,empName,empDept) customer (custId,custName,salesRepId,rating) salesRepId is a foreign key referring to empId of ... all the employees with all their customers having a 'GOOD' rating.
14.0k
views
10 answers
60 votes
go_editor asked Sep 28, 2014
14,019 views
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order.int ProcessArray(int *listA, int x, int n) { ... in $listA$.It will return −$1$ even when $x$ is present in $listA$.
3.9k
views
3 answers
11 votes
go_editor asked Sep 28, 2014
3,945 views
Consider the decision problem $2CNFSAT$ ... constant time since any input instance is satisfiable.NP-hard but not NP-complete.