Write first-order logic statements for following statements:

(i) If a perfect square is divisible by a prime p then it is also divisible by square of p.

(ii) Every perfect square is divisible by some prime.

(iii) Alice does not like Chemistry and History.

(iv) If it is Saturday and warm, then San is in the park.

(v) Anything anyone eats and is not killed by is food.

(i) If a perfect square is divisible by a prime p then it is also divisible by square of p.

FOL : x [p (PerfectSquare(x) ^ Divisible(x,p)) ⇒ Divisible(x,p2)] // Prime ‘p’, Number ‘x’

(ii) Every perfect square is divisible by some prime.

FOL : x [p (PerfectSquare(x) ⇒ Divisible(x,p) ^ Prime(p)]

(iii) Alice does not like Chemistry and History.

FOL : ~ Likes(Alice, Chemistry) ^ Likes(Alice, History)

(iv) If it is Saturday and warm, then San is in the park.

FOL : x (Saturday(x) ^ Warm(x) ⇒ IN(San, Park)) //Day x

(v) Anything anyone eats and is not killed by is food.

FOL : x [y (Eats(x, y) ^ Killed(y, x)) ⇒ y Food(y)

.

Update: Added NOT symbol in the third statement