Translate the following inference to logic notation: Richard is not playing a game. For all x, if x_12 works, then x_12 is playing a game. If Richard plays a game, then Jennifer is sleeping. If Jennifer sleeps, then Richard is working. Therefore Jennifer is not sleeping.
~P(a). forall x: Q(x) -> P(x). P(a) -> p. p -> Q(a). Therefore ~p.