Translate the following inference to logic notation: If Karen works, then Linda is playing a game. If Linda plays a game, then Karen is running. For all x, if x goes running, then x is working. Therefore Karen is working if and only if Linda is playing a game.
P(a) -> p. p -> Q(a). forall x: Q(x) -> P(x). Therefore P(a) <-> p.