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.1 - Page 107: 23


a. $\forall x$, if x is an equilateral triangle, then x is isosceles. $\forall$ equilateral triangles x, x is isosceles. b. $\forall x$, if x is a computer science student, then x needs to take data structures. $\forall$ computer science students x, x needs to take data structures.

Work Step by Step

A statement of the form $\forall x \in U$, if $P(x)$ then $Q(x)$ can always be rewritten in the form: $\forall x \in D$, $Q(x)$ by narrowing $U$ to be the domain $D$ consisting of all values of the variable $x$ that make $P(x)$ true.
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.