SKEDSOFT

Discrete Mathematics

iv) The truth table is as follows.

All the entries in the last column are ‘F’. Hence it is contradiction.

v) The truth table for [ p ∧ ( p → ¬ q ) → q ]

The last entries are neither all ‘T’ nor all ‘F’.
[ p ∧ ( p → ¬ q ) → q ]  is a neither tautology nor contradiction. It is a contingency.