The solution to this exercise is straightforward by constructing the truth table.

By looking at the truth table for the two compound propositions p → q and ¬q → ¬p, we can conclude that they are logically equivalent because they have the same truth values (check the columns corresponding to the two compound propositions)

**Related posts:**

- Use truth tables to verify these equivalences( Ex.1 pp 34 from the textbook)
- Show that ¬(¬p) and p are logically equivalent (Ex. 2 pp 34 from the textbook)
- Use truth tables to verify the associative laws (Ex. 4 pp. 34 from the textbook)
- Use a truth table to verify the first De Morgan law (Ex. 6 pp. 34 from the textbook)
- What are propositional equivalences in Discrete Mathematics?
- How to create the truth table for a compound proposition
- Show that p↔ q and (p∧q)∨(¬p∧¬q) are logically equivalent