Translate the following inference to logic notation: For all x, if x_8 plays a game, then x_8 is curious. For all x, if x_8 plays a game, then x_8 is curious. For all x, if x_8 were curious, then x_8 is playing a game. Therefore if Michael were curious, then Michael is playing a game.
forall x: P(x) -> Q(x). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). Therefore Q(a) -> P(a).