Write a formal negation for each of the following statements: a.
∀
fish x, x has gills. b.
∀
computers c, c has a CPU. c.
∃
a movie m such that m is over 6 hours long. d.
∃
a band b such that b has won at least 10 Grammy awards.

See below

Step-by-step explanation:

Let P(x) be a predicate over the variable x. Rules from logic tell us that the negation of ∀xP(x) is ∃x(¬P(x)). That is, the negation operator ¬ satisfies ¬(∀xP(x))≡∃x(¬P(x)). Similarly, ¬(∃xP(x))≡∀x(¬P(x)).

Apply these rules to each statement to obtain:

a) ∃ a fish x, x does not have gills.

b) ∃ a computer c, c does not have a CPU.

c) ∀ movie m, m is not over 6 hours long. ⇔  ∀ movie m, m is under 6 hours long.

d) ∀ band b, b has not won at least 10 Grammy awards. ⇔ ∀ band b, b has  won less than 9 Grammy awards.

your answer is a

step-by-step explanation:

plzplzplzplzplz mark brainliest i need it.

answer: yard ramps with a level off platform are typically 36 feet long. truck, rather than at an angle, enabling access to those pallets at the very back of the truck. if you are using your yard ramp to convert a loading dock into a drive-in door, we even at 60 inches (5 feet) high and a 30 foot ramp, the slope of the ramp will be less

step-by-step explanation: