91 views

Which of the below first order logic formulae represent the sentence

There is a student who is loved by every other student

Here, $\text{Loves}(x,y)$ means $x$ loves $y$

1. $\exists x (\text{Student} (x) \wedge \forall y (\text{Student} (y) \wedge \neg (x=y) \rightarrow \text{Loves} (y,x)))$
2. $\exists x (\text{Student} (x) \rightarrow \forall y (\text{Student} (y) \wedge \neg (x=y) \wedge \text{Loves} (y,x)))$
3. $\exists x (\text{Student} (x) \wedge \forall y (\text{Student} (y) \wedge \neg (x=y) \vee \text{Loves} (y,x)))$
4. $\exists x (\text{Student} (x) \wedge \forall y (\text{Student} (y) \to \neg (x=y) \rightarrow \text{Loves} (y,x)))$
edited | 91 views
+1
Is it A
+2
options A and D are same...

Someone plz correct it...
0
where are the answers for these questions ?