Translate the following inference to logic notation: John is not driving a car or Jessica is playing a game. If John were a taxi driver, then Thomas is sad. For all x, y is not curious or y is a taxi driver. For all x, y is curious or y will drive a car. If it is late, then Thomas is sad. If Jessica plays a game, then it is late. Therefore Thomas is sad.
~P(a) or p. Q(a) -> q. forall x: ~R(x) or Q(x). forall x: R(x) or P(x). r -> q. p -> r. Therefore q.