Translate the following inference to logic notation: If Michael were a carpenter, then Michael is running. For all x, x_11 is a carpenter if and only if x_11 will go running. Michael is not a carpenter. Therefore Michael is not running.
P(a) -> Q(a). forall x: P(x) <-> Q(x). ~P(a). Therefore ~Q(a).