Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Math Forum
»
Discussions
»
Math Topics
»
discretemath
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Topic:
logical equivalence problem
Replies:
8
Last Post:
Dec 8, 2008 8:42 PM




logical equivalence problem
Posted:
Nov 29, 2008 12:41 AM


Hello everyone, I've been asked to show with logical equivalence laws that...
~(p <> q) is equivalent to (~q) <> p)
I have tried working both sides of this one and keep getting stuck at certain points. By truth table, it is easy to see that they are equivalent.
This is how I've tried working the left side...
~(p <> q) ~((p>q)^(q>p)) bicond. written as (if and if) ~((~p v q) ^ (~q v p)) ifthen written as or stmnt ~(~p v q) v ~(~q v p) De Morgan's law (p ^ ~q) v (q ^ ~p) De Morgan's law ~(p > q) v ~(q > p) negation of if stmnt
This is pretty much where I get stuck. Any suggestions would be greatly appreciated.
Message was edited by: mike1234



