There are three children, Tim, Pam, and Ray, arguing about who of them is the best soccer player.
Tim: "I am the best!"
Pam: "No you're not!"
Ray: "I am the best!"
Tim: "No you're not!"
Pam: "I am the best!"
As we all know, the best soccer player never lies.
Who is the best soccerplayer?
First one to solve this gets a smarty-cookie that can be attached to your signature. It makes all other forum users obey.
The right answer:
We shall do this by formalizing:
t: Tim is best, p: Pam is best, r: Ray is best.
Now we shall formalize the arguments of the children (in the same order than they are given):
t ↔ t p ↔ ¬t r ↔ r t ↔ ¬r p ↔ p
Now we take away tautologies, which are arguments 1, 3 and 5.
So we have left:
p ↔ ¬t and t ↔ ¬r
And also we know that only one of the children is the best, which means that
t ˅ p ˅ r
has to be true (it must get value 1=true)
¬↔→ ˅ ˄
And therefore we can say that there can't be 2 best players, which means that all these:
t˄p, t˄r, p˄r
are false (they always get value 0=false)
We can write it like this:
¬((t˄p) ˅ (t˄r) ˅ (p˄r))
Now we make a truth value table of these. 1=true, 0=false
And to make the next table simpler, let's say
(t˄p) ˅ (t˄r) ˅ (p˄r) = A
And now we shall only inspect the interesting columns of these 2. I have highlighted the things that give us the right answer:
As we can see, all the arguments that were supposed to get value 1, get the value 1 on the same row where t=1, p=0, r=0
-> Tim is the best soccer player
PriSoner WON THE COOKIE!
Sorry, at first i wrote no one won :S i didn't notice he had a real explanation there!!
It was accurate enough
Congratulations!
oh and PriSoner btw: you put that ugly thing to your sig or you cry and put that ugly thing to your sig














Reply With Quote









