Convert sentences into First Order Logic

Upeksha
Messages
5
Reaction score
0
(1) Anyone who is thin, tall and energetic will be good basketball player.
(2) Some people are tall but not good basketball players.
(3) Anyone who do exercise or eating healthy food will be energetic.
(4) Saman is thin and tall person who do exercises.

Write the above sentences in First Order Logic.

I have tried like this:

(1) ∀x thin(x) ∧ tall(x) ∧ energetic(x) → good_basketball_player(x)
(2) ∃x tall(x) ¬ good_basketball_player(x)
(3) ∀x do_exercise(x) ∨ eating_healthy_food(x) → energetic(x)
(4) thin(saman) ∧ tall(saman) ∧ do_exercise(saman)
 
Physics news on Phys.org
Some parentheses in the first three sentences would help to make it clear which part the quantifiers apply to. You're also missing a ∧ in #2.
 
  • Like
Likes Upeksha
Thank you. Is it correct now?

(1) ∀x [thin(x) ∧ tall(x) ∧ energetic(x)] → good_basketball_player(x)
(2) ∃x [tall(x) ¬ good_basketball_player(x)]
(3) ∀x [do_exercise(x) ∨ eating_healthy_food(x)] → energetic(x)
(4) thin(saman) ∧ tall(saman) ∧ do_exercise(saman)
 
I'd probably put parentheses around the whole statement for 1 and 3. Otherwise you've got a situation where x is both a free and a bound variable.
 
  • Like
Likes Upeksha
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Replies
10
Views
3K
Replies
35
Views
5K
Replies
26
Views
4K
Replies
4
Views
2K
Replies
6
Views
3K
Replies
3
Views
2K
Replies
5
Views
2K
Replies
1
Views
2K
Back
Top