anonymous
  • anonymous
Need help on discrete math. I need to proof the bellow statement without using the true table. So can somebody walk me step by step please.
Mathematics
chestercat
  • chestercat
See more answers at brainly.com
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
|dw:1435952671366:dw|
anonymous
  • anonymous
|dw:1435955364263:dw|
anonymous
  • anonymous
$$ \begin{array}{c|c} p & q & \neg p & p\lor q & \neg p\land(p\lor q) & (\neg p\land(p\lor q))\rightarrow q\\ \hline T & T & F & T & F & T \\ T & F & F & T & F & T \\ F & T & T & T & T & T \\ F & F & T & F & F & T \end{array}$$ so it's a tautology

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
@oldrin.bataku without using the truth table
anonymous
  • anonymous
it's a natural rule of deduction; what proof system are you using?

Looking for something else?

Not the answer you are looking for? Search for more explanations.