0 votes 0 votes Use truth tables to verify the associative laws. $(p \vee q) \vee r \equiv p \vee (q \vee r).$ $(p \wedge q) \wedge \equiv p \wedge(q \wedge r).$ Mathematical Logic kenneth-rosen discrete-mathematics mathematical-logic propositional-logic + – Pooja Khatri asked Mar 15, 2019 Pooja Khatri 356 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.