Associative laws with negation Is it possible to simplify a statement like the one below with the associative law despite the negation? I can't seem to find a law that outlines this. The associative law is the closest I could find.
\begin{align}
\ (\lnot p \land \lnot q) \ \lor \ q 
\end{align}
If the above is possible, is it also possible if only one variable in the brackets were to be negated like the below?
\begin{align}
\ (p \land \lnot s) \ \lor \ s 
\end{align}
Thanks.

When applying the rules, the negation play no role.
Your expression is 
$$(a\land b)\lor c,$$ and can be rewritten
$$(a\lor c)\land(b\lor c)$$ by virtue of distributivity (not associativity).
Now plugging the actual arguments,
$$(\lnot p\land \lnot q)\lor q=(\lnot p\lor q)\land(\lnot q\lor q)$$ which can be simplified.
You second expression can be handled the same way.
