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.2 - Page 117: 47

Answer

If a computer program is of reasonable correctness, then the program has an absence of error messages during translation. But there exists a program that has an absence of error messages during translation and that program does not have reasonable correctness.

Work Step by Step

Recall the definition of sufficient: "$\forall x$, r(x) is a sufficient condition for s(x)" means "$\forall x$, if r(x) then s(x)." Recall the definition of necessary: "$\forall x$, r(x) is a necessary condition for s(x)" means "$\forall x$, if ~r(x) then ~s(x)" or equivalently "$\forall x$, if s(x) then r(x)." In this case r(x) is: a computer program has an absence of error messages during translation. s(x) is: the program is of reasonable correctness. So the rewriting of the necessary statement without the use of necessary is: if s(x) then r(x), which is, "if a computer program is of reasonable correctness, then the program has an absence of error messages during translation." Recall the form of the negation of a universal conditional statement: $~(\forall x, P(x) \rightarrow Q(x)) \equiv \exists x$ such that $(P(x) \land $ ~$Q(x))$ So the negation of the sufficient statement is r(x) and ~s(x) which is, "there exists a program that has an absence of error messages during translation and that program does not have reasonable correctness."
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.