edited by
5,607 views
28 votes
28 votes

Consider the following well-formed formulae:

  1. $\neg \forall x(P(x))$
  2. $\neg \exists x(P(x))$
  3. $\neg \exists x(\neg P(x))$
  4. $\exists x(\neg P(x))$


Which of the above are equivalent?

  1. $\text{I}$ and $\text{III}$
  2. $\text{I}$ and $\text{IV}$
  3. $\text{II}$ and $\text{III}$
  4. $\text{II}$ and $\text{IV}$
edited by

7 Answers

Answer:

Related questions

40 votes
40 votes
8 answers
1
34 votes
34 votes
8 answers
2
gatecse asked Sep 15, 2014
8,592 views
The binary operation $\Box$ is defined as follows$$\begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \textbf{P} \Box \textbf{Q}\\\hline \text{T} & \text{T}& \text{T...
54 votes
54 votes
6 answers
3
Rucha Shelke asked Sep 18, 2014
9,268 views
Which one of the first order predicate calculus statements given below correctly expresses the following English statement? Tigers and lions attack if they are hungry or ...