Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.)G(x): x is a gameM(x): x is a movieF(x, y): x is more fun than ya. Any movie is more fun than any game.b. No game is more fun than every movie.c. Only games are more fun than movies.d. All games are more fun than some movie.

Please answer the question 4, 5, 6

Suppose that: • variable X can represent any creature, • the predicate tove(X) is true if and only if X is a tove, • the predicate slithy(X) is true if and only if X is slithy, and • the function action(X) is a function that returns the kind of action that X is able to perform. Write a statement in predicate logic with the following meaning: "Any tove that can gyre or gimble must also be slithy." The following symbols are provided for you to copy if you wish (though not many of them are needed in this question, and you are not limited to using only the symbols that are listed here): 3 V A V ¬ A → € e ± Answer:

Tanslate each of these statements into logical expressions using predicates, quan-tifiers, and logical connectives. A)  Not all cats can jump high. Assume the domain is all animals. B) Some cats hate all dogs. Assume the domain is all animals. C) No drivers obey the speed limit if they are in a hurry. Assume the domain is allpeople.

I will thumbs up if you answer all. please convert FOL to CNF  Convert each of the following English statements into a single first-order logic sentence using the following constants and predicates. •Constants: Apples, Oranges, Chess, Go, John, Mary. •Predicates: oLikes(x,y): person x likes food y oPlays(x,y): person x plays game y a.If a personlikesApples, then they play chess. b.If a person likesOranges, then they play Go. c.A person likesApples or Oranges, but not both. d.John likes apples. e.Mary does not like anything that John likes. and then: Convert each of the first-order logic sentences in Problem 2to conjunctive normal form (CNF). There is no need to show intermediate steps. Assign each clause number: C1, C2, etc.

Using the predicate symbols shown and the appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) B(x): x is a bee. F(x): x is a flower. L(x, y): x loves y All bees love all flowers which one of these answer choices a. (∀x)(B(x) → [(∃y)(F(y) ∧ L(x, y)] b. (∀x)(B(x) → [(∀y)(F(y) ∧ L(x, y)] c. (∀x)(B(x) → [(∀y)(F(y) → L(x, y)] d. (∀x)(B(x) ∧ [(∃y)(F(y) → L(x, y)]

The teams is a sports competition are divided into six groups with five teams in each group. Each team plays the other teams in its group once only. Write a Prolog preciate schedule(S) that is true if S is a valid schedule. A schedule lists the fixtures for each day of the competition. In a fixture (A,B), team A is the home team and team B is the away team. A schedule is valid if: • there are no more than three matches on any day, • each team has the same number of home and away fixtures in the whole schedule, and • each team has at least four rest days between fixtures. Ideally the schedule S should be as short as possible, and the predicate schedule should be able to generate multiple valid schedules.

Define the following predicates: • A(x) : x is on the board of directors." • E(x) : x earns more than $100, 000. • W(x) : x works more than 60 hours per week. The domain is the set of all employees of a certain company. Match each English statement with its equivalent logical expression. ? v 1. Everyone who works more than 60 hours per week earns more than $100,000. A. 3x(E(x) ^ ¬W(x)) B. Vx(W(x) → E(x)) C. Ex(¬A(x) → E(x)) D. Vx(W(x) ^ E(x)) E. 3x(¬A(x) ^ E(x)) F. 3x(A(x) ^ ¬E(x)^ W(x)) G. Ex(A(x) V ¬E(x) V W(x)) H. Vx(A(x) → E(x)) I. Vx(A(x) ^ E(x)) 2 v 2. Someone on the board of directors does not earn more that $100.000 and works more than 60 hours per week. ? v 3. Every member of the board of directors earns more than $100,000. 2. v 4. There is someone who is not on the board of directors and earns more than $100,000. ? v 5. There is someone who earns more than $100,000, but does not work more than 60 hours per week.

One of the following items is a run-on (or fused) sentence, another contains a comma splice, and another is correct. Choose the item that is correct. One of the following items is a run-on (or fused) sentence, another contains a comma splice, and another is correct. Choose the item that is correct.     The food in that diner is awful besides the service is slow.     The food in that diner is awful, besides the service is slow.     The food in that diner is awful; besides, the service is slow.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) D(x): x is a day S(x): x is sunny R(x): x is rainy M: Monday T: Tuesday 1.All animals are dogs.  3.Some animals are not cats. 4.Every animal that is a dog is not a cat. 5.Some animals are dogs and cats. 6.No animal is both a dog and a cat. 7.An animal is always a dog only if it is a cat. 8.No animals are dogs. 9.Meg is a cat; all animals are cats. 10.Meg and Alex are both cats. 11.If one animal is a cat, then every animal will be a cat.