Translate the following inference to logic notation: For all x, if x_11 plays squash, then x_11 is working. For all x, if x_11 works, then x_11 is curious. Linda is playing squash or Thomas is not a janitor. Therefore if Thomas were a janitor, then Linda is curious.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). P(a) or ~p. Therefore p -> R(a).