3 votes 3 votes Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology. Prove it without Truth tables. Mathematical Logic kenneth-rosen discrete-mathematics mathematical-logic + – Shyam Singh 1 asked May 23, 2016 edited Mar 6, 2019 by Pooja Khatri Shyam Singh 1 853 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes (p v q) ∧ (~p v r) -> (q v r) = (p + q)(~p + r ) - > (q + r) = ~((p +q)(~p + r)) + (q + r) = (p + q)' + (p' + r)' + (q + r) = p'q' + pr' + q + r = (p'q' + q ) + ( pr' + r ) = (p' + q ) + ( p+ r) = (p' + p ) + q + r = T + q + r = T vijaycs answered May 23, 2016 selected May 24, 2016 by rude vijaycs comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes pavan singh answered Jan 21, 2023 pavan singh comment Share Follow See all 0 reply Please log in or register to add a comment.