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