Show that (p→q)→r and p→(q→r) are not equivalent
Im not sure what type of answer they want, i know im not supposed to use a truth table...
srry if this is a newbish question just started reading the textbook and im self teaching
Strictly speaking, one must use truth tables to prove that something is not equivalent in an introductory course. (There are also methods from proof theory, but I would think that they are not introductory-level.) Are there similar examples with solutions in the textbook? What is the context, i.e., what are the surrounding sections about?
To add: One way to show that two formulas are not equivalent is to convert them to full disjunctive normal forms and to show that they are different. However, the auxiliary statement that formulas are equivalent iff they have the same full disjunctive normal form is proved using truth tables.
My apologies for being vauge, the chapter the question was in had just introduced logical equivalencies (De Morgans Laws...etc) so very introductory.
I found an answer, however i don't understand how/why they've answered it this way there were no examples answered this way and the previous questions were not answered this way either it just seems very out of context,
These are not logically equivalent because when p, q, and
r are all false, (p→q)→r is false, but p→(q→r) is true.
maybe i should supplement the book im reading with something else.
Thanx for the quick responses
It just seems to be the way it was answered and the setting of the question that confused me, im not really fussed about it as i now understand it i just thought it would be worth asking to get some clarification. Thanks for all answers they are very much appreciated