0 votes 0 votes The equivalence of $\neg \: \exists \: x \: Q \: (x)$ is $\exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: \neg \: Q \: (x)$ $\neg \: \exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: Q \: (x)$ Discrete Mathematics ugcnetcse-july2018-paper2 discrete-mathematics quantifiers + – Pooja Khatri asked Jul 13, 2018 recategorized May 23, 2020 Pooja Khatri 3.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes The answer is Option B Pooja Khatri answered Jul 14, 2018 Pooja Khatri comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes To negate ∃x : Q(x), we must claim that Q(x) fails to hold for any possible x. So again we flip the quantifier and then negate the predicate : ∀x ~Q(x) i.e. Option (2) Sayan Bose answered Jul 14, 2018 Sayan Bose comment Share Follow See all 0 reply Please log in or register to add a comment.