Stephanie W.

# Use laws of logic to prove ¬ ( p → ¬ q ) ∨ ( q ∧ ( p ∨ ¬ q)) is equivalent to ( p and q)

Please write a detailed answer using the laws used to get to (p and q)

By:

Tutor
New to Wyzant

Senior undergraduate - tutoring in math, CS, and English!

Stephanie W.

p ∧ (q ∨ ( q ∧ ( p ∨ ¬ q))) What law is used here? associative and ? Also is there a different way to do it?
Report

03/23/21

Alec C.

At that step I regrouped the parentheses, which is just the associative law. Nothing else at that step. I'm sure it's possible to solve this by working on the right side, but I think the way I did it above is probably the fastest/simplest way to do this problem.
Report

03/23/21

Alex V.

tutor
I don't think the associative law let's you move the parentheses like that. However, you can use the distributive laws to move from (p ∧ q) ∨ ( q ∧ ( p ∨ ¬ q)) to q ∧ (p ∨ ( p ∨ ¬ q)).
Report

03/24/21

## Still looking for help? Get the right answer, fast.

Get a free answer to a quick problem.
Most questions answered within 4 hours.

#### OR

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.