Translate the following inference to logic notation: James is not driving a car. For all x, x_3 will drive a car or x_3 will work. Therefore James is working.
~P(a). forall x: P(x) or Q(x). Therefore Q(a).