829 views

1 Answer

Best answer
2 votes
2 votes

$\text{No plane is hill}$              $\forall x \left ( plane(x) \rightarrow \sim hill(x) \right )$ ...............................1

$\text{Some hills are towns}$    $\exists x (hill(x) \wedge town(x) )$ ...................................2

 

Conclusion : 

$\text{No town is plane    }$ $\forall x (town(x) \rightarrow \sim plane(x))$ ....................... 3

Assuming "No town is plane" is false 

So, $ \sim \forall x (town(x) \rightarrow \sim plane(x))$

$\exists x \sim (town(x) \rightarrow \sim plane(x))$

$\exists x \sim (\sim town(x) \vee \sim plane(x))$

$ \exists x  ( town(x) \wedge plane(x)) $ ...................... 4

Now 3 and 4 can both be true because premises 1 and 2 are not sufficient to conclude 3.

The scenario above is true for both the premises and also true for 4. There exists a town which is plane.

 

The scenario above is true for both the premises and also true for 3. No town is plane.

So premise 1 and 2 are not sufficient enough to conclude $\text{No town is plane}$

selected by

Related questions

268
views
0 answers
0 votes
500
views
1 answers
0 votes
radha gogia asked Aug 26, 2018
500 views
P->RQ->R How is the conclusion is (P^Q)->R ?I could only derive that both P and Q are true .
1.3k
views
0 answers
0 votes
shekhar chauhan asked Apr 22, 2016
1,301 views
“All hummingbirds are richly colored.”“No large birds live on honey.”“Birds that do not live on honey are dull in color.”“ ... i get some different ans , so that ans would be right or wrong .
526
views
1 answers
0 votes
radha gogia asked Jul 5, 2015
526 views
Cross Edge(a,b) is defined as an edge between two non-ancestor nodes in DFS , so my query is that how is this stmt true :arrival[b] <departure[b] <arrival[a] <departure[a] ...