Question

First Order Logic

Question #3 (FOL) (25 points (3.1.) 15; (3.2.) 10) 3.1. Define an appropriate language and formalize the negation of the following sentences using FOL formulas Example: There is a type of spider that is red and poisonous. 3x (Spyder(x)a Poisonous(x) ^ Red(x)) Vx (-Spyder(x) v-Poisonous(x) v -Red(x)) Negation Continue on next page (a) Some people like Python. (b) Every box contains at least one coin (c) All red objects are to the left of all green objects. 3.2. Define an appropriate language and formalize the following sentences using FOL formulas. (a) Every cat loves anyone who gives the cat a good food. (b) There are at least two rooms.