1 / 18

Conditional Statements

Conditional Statements. Lecture 3 Section 1.2 Mon, Jan 22, 2007. The Conditional. A conditional statement is a statement of the form p  q p is the hypothesis . q is the conclusion . Read p  q as “ p implies q .” The idea is that the truth of p implies the truth of q .

prue
Download Presentation

Conditional Statements

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Conditional Statements Lecture 3 Section 1.2 Mon, Jan 22, 2007

  2. The Conditional • A conditional statement is a statement of the form p q • p is the hypothesis. • q is the conclusion. • Read p q as “p implies q.” • The idea is that the truth of p implies the truth of q.

  3. Truth Table for the Conditional • p  q is true if p is false or q is true. • p  q is false if p is true and q is false.

  4. Example: Conditional Statements • “If it is Wednesday, then Discrete Math meets today.” • This statement is true • if Discrete Math meets today (whether or not it is Wednesday), and • if it is not Wednesday (whether or not Discrete Math meets today). • It is false only if it is Wednesday and Discrete Math does not meet today.

  5. The Contrapositive • The contrapositive of pq is qp. • The statements pqandqp are logically equivalent.

  6. qp pq pq qp The Converse and the Inverse • The converse of pq is qp. • The inverse of pq is pq.

  7. converses qp pq converses pq qp The Converse and the Inverse • The converse of pq is qp. • The inverse of pq is pq.

  8. converses qp pq inverses inverses converses pq qp The Converse and the Inverse • The converse of pq is qp. • The inverse of pq is pq.

  9. converses qp pq inverses inverses contra positives converses pq qp The Converse and the Inverse • The converse of pq is qp. • The inverse of pq is pq.

  10. The Biconditional • The statement p qis the biconditionalof p and q. • p q is logically equivalent to (p  q)  (q  p).

  11. Exclusive-Or • The statement p q is the exclusive-or of p and q. • p q is defined by

  12. Exclusive-Or • p q means “one or the other, but not both.” • p q is logically equivalent to (pq)  (qp) • p q is also logically equivalent to (p q) • p q is also logically equivalent to (pq)  (p q)

  13. The NAND Operator • The statement p| q means “not both p and q.” • The operator | is also called the Scheffer stroke or NAND. • NAND stands for “Not AND.” • p | q is logically equivalent to (p  q).

  14. The NAND Operator • p| q is defined by

  15. The NAND Operator • The three basic operators may be defined in terms of NAND. • p  p | p. • p  q  (p | q) | (p | q). • p  q  (p | p) | (q | q).

  16. The NOR Operator • The statement p q means “neither p nor q.” • The operator  is also called the Pierce arrow or NOR. • NOR stands for “Not OR.” • p  q is logically equivalent to (p  q).

  17. The NOR Operator • p q is defined by

  18. The NOR Operator • The three basic operators may be defined in terms of NOR. • p  p  p. • p  q  (p  q)  (p  q). • p  q  (p  p)  (q  q).

More Related