How do you translate the following into PL using quantifiers?

Anyone who's liked by everyone likes themselves.
Everyone who likes Jack likes everyone.
At most one team wins.
The only team that won is the only theam that played fair.
The King and President are the same person.
The King is bald, but the president is not bald

Quote:

---

Originally Posted by nsion8

How do you translate the following into PL using quantifiers?

Anyone who's liked by everyone likes themselves.
Everyone who likes Jack likes everyone.
At most one team wins.
The only team that won is the only theam that played fair.
The King and President are the same person.
The King is bald, but the president is not bald

---

This should be of help

List of logic symbols - Wikipedia, the free encyclopedia

When looking at the list you might consider the words EVERYONE and ANYONE are universal quantifiers-they can be represented by a symbol. As you probably know quantifiers are used by prefixing symbols to variables.

The other type of quantifier used is the 'existential quantifier' (there exists at least ONE... ). Again, you probably know what this symbol looks like.

You might also consider natural connectives e.g. King and President being the same person. Consider variables which are free or bound by the quantifiers.

Tut