Consider the following premises. w -> ~q. s_3 <-> w. p <-> s_3. q. Can we infer p from them? If possible, name the inference rules being used at each step.
 From w -> ~q, q we can infer ~w via modus tollens. From s_3 <-> w, ~w we can infer ~s_3 via biconditional elimination. Finally, from p <-> s_3, ~s_3 we can infer ~p via biconditional elimination, which contradicts p. Therefore, the answer is no.