Translate the following inference to logic notation: For all x, x_4 will drive a car. For all x, x_4 is fast. For all x, if x_4 were fast, then x_4 is a server. Therefore Linda is a server.
forall x: P(x). forall x: Q(x). forall x: Q(x) -> R(x). Therefore R(a).