Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 1 - Section 1.3 - Propositional Equivalences - Exercises - Page 36: 60

Answer

See step by step work for proof.

Work Step by Step

An unsatisfiable compound proposition is always false and thus is equivalent with F. The negation of the unsatisfiable compound proposition is then equivalent with t and is thus always true, this means that the negation of the unsatisfiable compound proposition is a tautology. A tautology is always true and is thus equivalent with T. The negation of the tautology is then equivalent with F and is thus always false, this means that the negation of a tautology is unsatisfiable.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.