Consider the following premises. W(g) -> q. Q(g) -> q. forall y_1: W(y_1). Can we infer ~q from them? If possible, name the inference rules being used at each step.
 From forall y_1: W(y_1) we can infer forall y_1: W(y_1) or Q(y_1) via universal addition. From forall y_1: W(y_1) or Q(y_1) we can infer W(g) or Q(g) via universal instantiation. Finally, from W(g) -> q, Q(g) -> q, W(g) or Q(g) we can infer q via disjunction elimination, which contradicts ~q. Therefore, the answer is no.