You are not logged in.
Pages: 1
hello everyone, i'm new to the forum and i was wondering if anyone in here knows about logical equivalences for discrete maths since i have problem with them and im not getting by
Offline
If you want serious help, you might want to be a bit more specific than that
Support MathsIsFun.com by clicking on the banners.
What music do I listen to? Clicky click
Offline
ok here is what i would on (( p imlies q) and (q implies r)) is equivalent to (p implies(q and r) prove this without doing truth tables
Offline
You must first know that:
p⇒q is equivalent to ~p or q
So:
p⇒q and q⇒r is quivalent to (~p or q) and (~q or r)
Try to work it from there, see if you can come up with anything. If you can't, just reply back here and we'll help you.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
ok this is what i have
p⇒q and q⇒r
is quivalent to (~p or q) and (~q or r) distribution of and
= ( (~p or q) and ~q) or ((~p or q) and r)
= ((~q and ~p) or (~q or q)) or ((~p and r) or( q and r)
= (((~q and ~p) or F or ((~p and r) or( q and r)
= ~p or (q and r)
= p implies (q and r)
i dont know if this is right but i tired please help me out
Offline
Shouldn't "~q or q" equal T?
Actually I never watch Star Wars and not interested in it anyway, but I choose a Yoda card as my avatar in honor of our great friend bobbym who has passed away.
May his adventurous soul rest in peace at heaven.
Offline
Pages: 1