Prove that two statements are logically equivalent
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Prove that two statements are logically equivalent

Prove that two statements are logically equivalent

[From: ] [author: ] [Date: 11-11-05] [Hit: ]
Its sloppy, but it will give you the proof you need.......
Prove that:
(P -> (Q->R)) <-> ((R->Q)->P)
and
P^ ((~Q)v R) v (Q^(~R)) are logically equivalent.


I will put this in words:
Prove that:
If P imples Q which implies R and P implies R, then R and Q imply P and vice versa,
is logically equivalent with:
P and not Q or R or Q and not R are logically equivalent.

-
Use a truth table. It's sloppy, but it will give you the proof you need.
1
keywords: that,two,equivalent,logically,statements,Prove,are,Prove that two statements are logically equivalent
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .