Translate the following inference to logic notation: There is at least one x for which z will not work or z is a taxi driver. For all x, z will work or z will cook. For all x, z will not cook or z will write a letter. Therefore there is at least one x for which z is a taxi driver or z will write a letter.
exists x: ~P(x) or Q(x). forall x: P(x) or R(x). forall x: ~R(x) or S(x). Therefore exists x: Q(x) or S(x).