7,544 views
1 votes
1 votes

Let L(x, y) be the statement "x loves y," where the do­main for both x and y consists of all people in the world. 
Use quantifiers to express: 
Q->There is exactly one person whom everybody loves.
E-some || A-for all ||
Answer-> Ex ( AyL(y,x) ^ Az((Aw L(w,z))->z=x) )
Can anyone explain the answer and how to solve these questions
i mean how to analyze these questions??

1 Answer

Best answer
8 votes
8 votes

First of all we have only two quantifiers- exists and forall. So, first try to convert the given sentence into a sentence containing those (its just English)

There is exactly one person whom everybody loves

This can be rewritten as

There is someone who is loved by everyone, and there is no one else who is loved by everyone

Again translated as:

There is someone, x, who is loved by everyone, and  if there is another one, y,  who is loved by everyone else, means x and y are the same person.

This can be translated into first order logic (first order logic is just propositional logic with ∃ and ∀)

∃x(∀yL(y,x) ⋀  (∀z(∀wL(w,z)) ⇨ (z = x)))

Here actually in place of w, we can use y as the life of y expires immediately after ∀yL(y,x) this. Using w instead of y is strictly not needed. 

You can also try to express "There is at most one person whom everybody loves" 

Now, the translations I did is based on my knowledge about the expressive powers of first order logic. That is first order logic can't be used for all statement forms- we first need to convert it into a suitable form. Luckily there are only a few cases, which you should get experienced by solving previous year questions in this topic. You can see the below 3 questions and they should cover almost any type of question from this topic. 

https://gateoverflow.in/256/gate1992_92-xv

https://gateoverflow.in/923/gate2003_33

https://gateoverflow.in/922/gate2003_32

edited by

Related questions