02.06.2013 Views

Discrete Mathematics Demystified

Discrete Mathematics Demystified

Discrete Mathematics Demystified

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

CHAPTER 1 Logic 13<br />

is the statement<br />

If x has four legs then x is a healthy horse<br />

Notice that these statements have very different meanings: the first statement is true<br />

while the second (its converse) is false. For instance, a chair has four legs but it is<br />

not a healthy horse. Likewise for a pig. <br />

EXAMPLE 1.18<br />

The statement<br />

If x > 5 then x > 3<br />

is true. Any number that is greater than 5 is certainly greater than 3. But the converse<br />

If x > 3 then x > 5<br />

is certainly false. Take x = 4. Then the hypothesis is true but the conclusion is<br />

false. <br />

The statement<br />

is a brief way of saying<br />

A if and only if B<br />

If A then B and If B then A<br />

We abbreviate A if and only if B as A ⇔ B or as A iff B. Now we look at a truth<br />

table for A ⇔ B.<br />

A B A ⇒ B B ⇒ A A ⇔ B<br />

T T T T T<br />

T F F T F<br />

F T T F F<br />

F F T T T<br />

Notice that we can say that A ⇔ B is true only when both A ⇒ B and B ⇒ A are<br />

true. An examination of the truth table reveals that A ⇔ B is true precisely when<br />

A and B are either both true or both false. Thus A ⇔ B means precisely that A and<br />

B are logically equivalent. One is true when and only when the other is true.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!