Translate the following inference to logic notation: For all x, z is not a cashier or z is a bartender. For all x, z is a cashier or z is a carpenter. For all x, z is a carpenter if and only if z is poor. For all x, if z were a bartender, then z is poor. Therefore for all x, z is poor.
forall x: ~P(x) or Q(x). forall x: P(x) or R(x). forall x: R(x) <-> S(x). forall x: Q(x) -> S(x). Therefore forall x: S(x).