Jump to content

Conditional statement (logic)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hanlon1755 (talk | contribs) at 20:46, 16 January 2012 (Added sentence distinguishing between the general conditional statement and the material conditional.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In philosophy, logic, and mathematics, a conditional statement is a proposition that can be written in the form "If p, then q," where p and q are propositions. The proposition immediately following the word "if" is called the hypothesis (also called antecedent). The proposition immediately following the word "then" is called the conclusion (also called consequence). In the aforementioned form for conditional statements, p is the hypothesis and q is the conclusion. A conditional statement is often called simply a conditional (also called an implication). Unlike the material conditional, a conditional statement need not be truth-functional.[1] Conditional statements are often symbolized using an arrow (→) as pq (read "p implies q"). The conditional statement in symbolic form is as follows:

As a proposition, a conditional statement is either true or false. A conditional statement is true if and only if the conclusion is true in every case that the hypothesis is true. A conditional statement is false if and only if a counterexample to the conditional statement exists. A counterexample to a conditional statement exists if and only if there is a case in which the hypothesis is true, but the conclusion is false.

Examples of conditional statements include:

  1. If I am running, then my legs are moving.
  2. If a person makes lots of jokes, then the person is funny.
  3. If the Sun is out, then it is midnight.
  4. If you locked your car keys in your car, then 7 + 6 = 2.

Variations of the conditional statement

The conditional statement "If p, then q" can be expressed in many ways; among these ways include[2][3]:

  1. If p, then q. (called if-then form[4])
  2. If p, q.
  3. p implies q.
  4. p only if q. (called only-if form[5])
  5. p is sufficient for q.
  6. A sufficient condition for q is p.
  7. q if p.
  8. q whenever p.
  9. q when p.
  10. q every time that p.
  11. q is necessary for p.
  12. A necessary condition for p is q.
  13. q follows from p.
  14. q unless ¬p.

The converse, inverse, contrapositive, and biconditional of a conditional statement

The conditional statement "If p, then q" is related to several other conditional statements and propositions involving propositions p and q.[6][7]

The converse

The converse of a conditional statement is the conditional statement produced when the hypothesis and conclusion are interchanged with each other. The resulting conditional is as follows:

The inverse

The inverse of a conditional statement is the conditional statement produced when both the hypothesis and the conclusion are negated. The resulting conditional is as follows:

The contrapositive

The contrapositive of a conditional statement is the conditional statement produced when the hypothesis and conclusion are interchanged with each other and then both negated. The result, which is equivalent to the original, is as follows:

The biconditional

The biconditional of a conditional statement is the proposition produced out of the conjunction of the conditional statement and its converse. When written in its standard English form, the hypothsis and conclusion are joined by the words "if and only if." The biconditional of a conditional statement is equivalent to the conjunction of the conditional statement and its converse. The resulting proposition is as follows:

  • ; or equivalently,

Notes

  1. ^ Hardegree 1994, p. 41-44
  2. ^ Rosen 2007, p. 6
  3. ^ Larson, Boswell, and Stiff 2001, p. 80
  4. ^ Larson et al. 2007, p. 79
  5. ^ Larson, Boswell, and Stiff 2001, p.80
  6. ^ Larson et al. 2007, p. 80
  7. ^ Rosen 2007, p. 8

References

  • Hardegree, Gary. Symbolic Logic: A First Course (2nd Edition). UMass Amherst Department of Philosophy, n.d. Web. 18 December 2011 <http://courses.umass.edu/phil110-gmh/text.htm>.
  • Larson, Ron, Laurie Boswell, and Lee Stiff. Geometry. Boston: McDougal Littell, 2001. Print.
  • Larson, Ron, Laurie Boswell, Timothy D. Kanold, and Lee Stiff. Geometry. Boston: McDougal Littell, 2007. Print.
  • Rosen, Kenneth H. Discrete Mathematics and Its Applications, Sixth Edition. Boston: McGraw-Hill, 2007. Print.

See also