Use the predicate specifications(x, y): x beats yF (x): x is an (American) football teamQ(x, y): x is quarterback of yL(x, y): x loses to yand the constant symbols c: Wildcats, j: Jayhawks to translate the following into predicate logic.(a)Every football team has a quarterback.(b)If the Jayhawks beat the Wildcats, then the Jayhawks do not lose to every football team.(c)The Wildcats beat some team, which beat the Jayhawks.

a) ∀y∃x(Q(x, y))

b) (B(Jayhawks, W ildcats)→¬∀y(L(Jayhawks, y)))

c) ∃x(B(Wildcats, x) ∧ B(x, Jayhawks))

Explanation:

a) The statement can be rewritten as "For all football teams, there exists a quarterback" which is written in logical symbols.

b) The statement is an implication and thus have a premise and a conclusion. The premise states "Jayhawks beat the Wildcats" which is translated using B(x, y). The conclusion can be rewritten as "It is not the case that Jayhawks lose to all football teams".

c) The statement is a simple conjunction which can be written as "There exists a team x such that the Wildcats beats x and x beats Jayhawks"

diy

explanation: