+22 votes
2.4k views

$\def\graph{\text{ Graph}} \def\connected{\text{ Connected}}$

Let $\graph(x)$ be a predicate which denotes that $x$ is a graph. Let $\connected(x)$ be a predicate which denotes that $x$ is connected. Which of the following first order logic sentences DOES NOT represent the statement:

$\qquad\text{"Not every graph is connected"}$

1. $\lnot \forall x\, \Bigl (\graph(x) \implies \connected(x) \Bigr )$
2. $\exists x\, \Bigl (\graph(x) \land \lnot \connected(x) \Bigr )$
3. $\lnot \forall x \, \Bigl ( \lnot \graph(x) \lor \connected(x) \Bigr )$
4. $\forall x \, \Bigl ( \graph(x) \implies \lnot \connected(x) \Bigr )$
asked
edited | 2.4k views

## 5 Answers

+32 votes
Best answer

D says "all graphs are not connected"  but the question says " not every graph is connected" .i.e " there exists at least one graph which is not connected". Hence the answer is (D)

answered by Active (2.6k points)
edited by
0
but is the any other approach to solve this type of the question..thanks
+1
It is negation of "every graph is connected".

So it should $\neg \forall x\;(G(x) \rightarrow C(x))$

$\equiv \neg \forall x\;(\neg G(x) \vee C(x))$

$\equiv \exists x\;(G(x)\wedge \neg C(x)$
+14 votes
Just writing to simplify each options

A)¬∀x( Graph(x)⟹ Connected(x))

it is not the case that every graph then it will be connected,which implies that

some graph my be disconnected.

B)∃x( Graph(x)∧¬ Connected(x))

there exists some graph which are disconnected which implies

not every graph is connected.

C)¬∀x(¬ Graph(x)∨ Connected(x))

here no need to express it in english just solve first using

de morgn's law we will get it as option B)

D)∀x( Graph(x)⟹¬ Connected(x))

for all graph it is always disconnected...makes it FALSE

ANSWER D
answered by Boss (16.4k points)
edited
0
very nice explanation...
0
C on solving gives option A and not B directly
+6 votes

1. No graph is disconnected.

2. Some disconected graphs.

3. same for of previous option just do ~ operation on it.

4. Not every graph is connected.

answered by Veteran (61.5k points)
+4 votes
If you see each options A,B,C are same only i.e

A) ¬∀x( Graph(x)⟹ Connected(x))

= ¬∀x( ~Graph(x) ∨ Connected(x))

= ∃x( Graph(x)∧¬ Connected(x))

B) ∃x( Graph(x)∧¬ Connected(x))

C) ¬∀x(¬ Graph(x)∨ Connected(x))

=  ∃x( Graph(x)∧¬ Connected(x))

So obviously D will be correct.
answered by (163 points)
0 votes

Option B is correct

Option D is incorrect as it means Every graph is not connected which is different from Not every graph is connected

Not every graph is connected
It can be rewritten as:

There is a graph which is not connected

so    ∃x(graph(x) ⋀ ¬connected(x)

or another way to do it ,simply:

¬∀x(graph(x) → connected(x))

∃x¬(graph(x) → connected(x))        (negation rule)

∃x¬(¬(graph(x) ⋁ connected(x))

And finally

∃x(graph(x) ⋀ ¬connected(x))

answered by (67 points)
+3
Question is for "DOES NOT"
–5
lol  i didnt read that,i am srry
Answer:

+20 votes
10 answers
1
+24 votes
6 answers
2
+25 votes
1 answer
3
+33 votes
3 answers
4
+45 votes
4 answers
5
+22 votes
4 answers
6
+37 votes
3 answers
7