Translate the following inference to logic notation: For all x, y will work or y is not an office clerk. For all x, y is an office clerk or y will play squash. For all x, y will work if and only if y will play squash. Therefore for all x, y will work or y is fast.
forall x: P(x) or ~Q(x). forall x: Q(x) or R(x). forall x: P(x) <-> R(x). Therefore forall x: P(x) or S(x).