Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 3 - The Logic of Quantified Statements - Exercise Set 3.4 - Page 142: 6

Answer

The conclusion is: $\therefore$ this program is not correct.

Work Step by Step

Universal modus tollens: $\forall x,$ if $P(x)$ then $Q(x).$ ~$Q(a)$, for a particular a, $\therefore$ ~$P(a).$ In this case P(x) is: a computer program x is correct. Q(x) is: compilation of the computer program x does not produce error messages. a is "this program." Therefore ~$P(a)$ is: this program is not correct.
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.