Translate the following inference to logic notation: For all x, if y_4 cooks, then y_4 is a server. For all x, if y_4 were a server, then y_4 is cooking. For all x, y_4 will not read a book. For all x, if y_4 cooks, then y_4 is reading a book. Therefore for all x, y_4 is not a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: ~R(x). forall x: P(x) -> R(x). Therefore forall x: ~Q(x).