Translate the following inference to logic notation: For all x, if z were a scientist, then z is a server. For all x, if z were a server, then z is a scientist. There is at least one x for which if z were a scientist, then z is a server. Therefore there is at least one x for which if z were a scientist, then z is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). exists x: P(x) -> Q(x). Therefore exists x: P(x) -> Q(x).