2 votes 2 votes Equivalent logical expression for the Well Formed Formula $(WFF)$, $\sim(\forall x) F\left[x\right]$ is $\forall x (\sim F\left[x\right])$ $\sim (\exists x) F\left[x\right]$ $\exists x (\sim F\left[x\right])$ $\forall x F\left[x\right]$ Mathematical Logic ugcnetcse-dec2014-paper3 mathematical-logic + – makhdoom ghaya asked Jul 30, 2016 • recategorized Jul 30, 2016 by LeenSharma makhdoom ghaya 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes ~(∀x) F(x) =(∃x)(~F(x)) So ans is C Prashant. answered Jul 30, 2016 • selected Aug 2, 2016 by Prashant. Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Negation of all of 'x' is equal to there exist 'x', so C is the answer Nikhil Prasad 1 answered Aug 2, 2016 Nikhil Prasad 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes When negation is brought before the atom, ∀ is converted to ∃ and vice versa. ~(∀x) F(x) =(∃x)(~F(x)) Prasanjeet Ghosh answered Jun 16, 2018 Prasanjeet Ghosh comment Share Follow See all 0 reply Please log in or register to add a comment.