Translate the following inference to logic notation: Linda is not working. For all x, if x_8 works, then x_8 is bored. For all x, if x_8 were bored, then x_8 is working. Linda is bored if and only if Mary is a scientist. Therefore Mary is not a scientist.
~P(a). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). Q(a) <-> p. Therefore ~p.