Alex, Some true logic wonks watch this site. From an amateur's standpoint, two different ideas may be useful: (1) Write up "truth tables" for the two propositions. To say they're equivalent is precisely to say that the truth value of the propositions is the same for each choice of "T or F" for p, q and r; (2) Show that assuming the first is false forces the second to be false, and vice versa. That sounds different from saying that the truth of the first implies the truth of the second and vice versa; but the result is the same, since showing p implies q is equivalent to showing that ~q implies ~p. As mentioned above, you should get considerably more high-powered advice from some pro logicians on here. It's your decision what to use for your class. Thanks for a great problem! Ben
> Date: Mon, 24 Sep 2012 13:57:29 -0400 > From: firstname.lastname@example.org > To: email@example.com > Subject: Need help w/ problem > > Hi all, back at math after a couple years break (even though I dont think the math I took would help with this). Anyway I'm just starting out with propositional equivalences and i needed help with this more intermediate problem. Any help would be greatly appreciated :) > Show that the compound propositions > ¬p V ¬q V ¬r and ¬p V (r -> ¬q) > are equivalent.