If I start with this: $$(\neg p \vee \neg q) \vee (r \vee q)$$ are the following logical deductions correct:
$$(\neg p \vee \neg q) \vee (q \vee r) \text{Commutative Property}$$ Property $$(\neg p \vee r) \vee (q \vee \neg q) \text{Associative Property}$$
I just want to make sure I'm using the commutative and associate property correctly.
Thanks!
Your use of the commutative property of $\lor$ is fine enough, though you are also implicitly using a substitutability property as well. Commutativity says $\varphi\lor\psi\equiv\psi\lor\varphi$ but that doesn't necessarily immediately imply that $\Phi(\varphi\lor\psi)\equiv\Phi(\psi\lor\varphi)$ where $\Phi$ is some expression parameterized by a formula, for example, we need substitutability to say that $\chi\lor(\varphi\lor\psi)\equiv\chi\lor(\psi\lor\varphi)$.
Your use of the associative property of $\lor$ is incorrect. Associativity means you can change where the parentheses are in a formula (when all operators are the same and it is associative, here $\lor$). Changing where you place the parentheses will not change the order in which the subformulas occur. Your second example can be arrived at from the the earlier formulas via multiple uses of associativity, but since the order of the subformulas change, you'll also need to use commutativity. Regardless, going from either of the earlier formulas to the third would involve multiple steps and equivalences other than associativity, so it doesn't make sense to call it an application of associativity.