Translate the following inference to logic notation: Linda is not a poet. For all x, if x_4 were a poet, then x_4 is playing a game. For all x, if x_4 plays a game, then x_4 is a poet. Therefore Linda is not playing a game.
~P(a). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). Therefore ~Q(a).