Consider the following premises. T(a_8) <-> q_4. ~q_4. forall x: T(x) or W(x). Can we infer ~W(a_8) from them? If possible, name the inference rules being used at each step.
 From forall x: T(x) or W(x) we can infer T(a_8) or W(a_8) via universal instantiation. From T(a_8) <-> q_4, ~q_4 we can infer ~T(a_8) via biconditional elimination. Finally, from T(a_8) or W(a_8), ~T(a_8) we can infer W(a_8) via disjunctive syllogism, which contradicts ~W(a_8). Therefore, the answer is no.