Consider the following premises. w_1 <-> t. p or t. ~w_1. Can we infer p or q from them? If possible, name the inference rules being used at each step.
 From w_1 <-> t, ~w_1 we can infer ~t via biconditional elimination. From p or t we can infer ~t -> p via rewriting. From ~t -> p, ~t we can infer p via modus ponens. Finally, from p we can infer p or q via addition. Therefore, the answer is yes.