We ran into an Interview question, writing part 3 days ago. one of the question is as follows: (definition of A(x) and B(x) is not given by OP)
what is the logical interpretation of following sentence:
"each muslems is not privy to god."
$I) \exists x (A(x) \wedge \neg B(x))$
$II) \forall x (A(x) \to \neg B(x))$
$III) \neg \forall x (A(x) \to B(x))$
$IV) \forall x (\neg B(x) \to A(x))$
the answer sheet wrote (2) is the answer. but we think (4) is true, too. and we must have Objection to this question. are we right?
If the formulas $A(x)$ and $B(x)$ were defined as part of the question then there there could be no ambiguity. If not:
if you define $A_2(x) =$ "$x$ is a Muslim" and $B_2(x) =$ "$x$ is privy to God", then your sentence translates into $\forall x (A_2(x) \to \neg B_2(x))$;
if you define $A_4(x) = \neg B_2(x)$ and $B_4(x) = \neg A_2(x)$, then your sentence translates into $\forall x (\neg B_4(x) \to A_4(x))$.
Please note that for 2. you need to assume "double-negation elimination", i.e.
which may or may not be the case (it is if you are working with classical logic).
Anyway, when translating a sentence from a natural language into a logic formula I would start by the syntax, i.e. by translating the connectives, and what is left (if it makes sense) into atomic formulas. I couldn't find a reference (yet), but if this is the convention, then case 2. cannot arise, because the connective $\neg$ could not be part of, say, $A_4(x)$.
Edit: Gary M. Hardegree writes in his Symbolic Logic: A First Course (see this freely available early edition):
Later on (see page 108 of the linked edition) he explains:
where an example of standard and idiomatic negation is (quotation marks mine):
In conclusion, the choice (IV) could be correct only if, when translating from English to sentential logic, we could define, say, $B(x)$ as "$x$ is not a Muslim". The quote above states that this by convention is not allowed, i.e. if you find a "not" you must translate it with $\neg$ and you cannot "hide" it in an atomic formula.
In other words: (IV) is a valid answer if and only if you can translate "each Muslim is not privy to God" into $\forall x (\neg B(x) \to A(x))$. If you drop the quantifier, this is the same as translating (in what follows, read '$\leadsto$' as "translates into") $$ \text{"if a person is Muslim, then that person is not privy to God"} \;\leadsto\; \neg B(x) \to A(x) $$ To do so, you need to make the following assignments:
Implication: "if ... then" $\;\leadsto\;$ '$\to$'
Variable: "person", "that person" $\;\leadsto\;$ '$x$'
First atomic formula: "$x$ is Muslim" $\;\leadsto\;$ '$\neg B(x)$': by the law of excluded middle, this implies the assignment "$x$ is not Muslim" $\;\leadsto\;$ '$B(x)$'
Second atomic formula: "$x$ is not privy to God" $\;\leadsto\;$ '$A(x)$'
The problem is that you are not allowed to do this, because assignments 3 and 4 are not possible in the conventional translation algorithm: you must translate "$x$ is not privy to God" into $\neg P(x)$, where $P(x)$ is "$x$ is privy to God" (and similarly for the other sentence), as explained in the above quote. In other words, every atomic formula (resulting from a translation of English into sentential logic) is assumed to be "positive".