Consider the following premises. w_3 -> w_2. p_8 <-> p_1. w_3 <-> t. w_2 -> p_1. ~p_8. Can we infer ~t from them? If possible, name the inference rules being used at each step.
 From w_3 -> w_2, w_2 -> p_1 we can infer w_3 -> p_1 via transitivity. From p_8 <-> p_1, ~p_8 we can infer ~p_1 via biconditional elimination. From w_3 -> p_1, ~p_1 we can infer ~w_3 via modus tollens. Finally, from w_3 <-> t, ~w_3 we can infer ~t via biconditional elimination. Therefore, the answer is yes.