The GATE Grind

GATE 2007 CS – Question 22

Engineering Mathematics · Discrete Mathematics: Propositional and First Order Logic · 2 marks · Multiple choice

Graph(x) means x is a graph; Connected(x) means x is connected. Which does NOT express “Not every graph is connected”?

  1. $\neg\forall x(Graph(x)\Rightarrow Connected(x))$
  2. $\exists x(Graph(x)\land\neg Connected(x))$
  3. $\neg\forall x(\neg Graph(x)\lor Connected(x))$
  4. $\forall x(Graph(x)\Rightarrow\neg Connected(x))$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) $\forall x(Graph(x)\Rightarrow\neg Connected(x))$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Propositional and First Order Logic questions

All Discrete Mathematics: Propositional and First Order Logic questions →