Hui C.

asked • 08/12/18

Verify is tautology by using logical equivalence

Verify is tautology by using logical equivalence:

((p ∨ q) ∧ (p → r) ∧ (∼ r)) → q

by showing what law is using

1 Expert Answer

By:

Hui C.

Sorry I should mention the solution format I needed earlier.
Can you please explain the solution again by the following format?
Need to prove:
((p ∨ q) ∧ (p → r) ∧ (∼ r)) → q ≡ tautology
≡ ((p ∨ q) ∧ (∼ p ∨ r ) ∧ (∼ r)) → q   (comment: since p → r same as ∼ p ∨ r)
≡ ... 
≡ tautology  
Report

08/12/18

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

Ask a question for free

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

OR

Find an Online Tutor Now

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