This question already has an answer here:
Here is sentence:
Every farmer who owns a donkey beats it
Everyone claims that the following translation to first order logic is not correct (or maybe lacking consistency how quantifiers are supposed to be translated)
\forall x \exist y (farmer(x) /\ donkey(y) /\ own(x,y) -> beat(x,y))
saying that truth conditions fails link. Could somebody help me understand how truth condition fails here? I think this is perfect translation.
P.S. no latex embedding on computational linguistics board?