Consider the following premises. ~w_1 -> q_1. w_1 <-> w. s_2. ~w. Can we infer s_2 and q_1 from them? If possible, name the inference rules being used at each step.
 From w_1 <-> w, ~w we can infer ~w_1 via biconditional elimination. From ~w_1 -> q_1, ~w_1 we can infer q_1 via modus ponens. Finally, from s_2, q_1 we can infer s_2 and q_1 via conjunction. Therefore, the answer is yes.