Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Logical conditional


 Contents
In logical calculus of mathematics, the logical conditional (also known as the material implication, sometimes material conditional) is a binary logical operator connecting two statements, if p then q where p is a hypothesis (or antecedent) and q is a conclusion (or consequent). The operator is denoted using a left-arrow "→".

The hypothesis is sometimes also called sufficient condition for the conclusion, while the conclusion may be called necessary condition for the hypothesis.

1 Conditional statements

A conditional statement, or simply a conditional for short, is an "if-then" statement, written in the form: 'if P, then Q'. Here, 'P' is the antecedent (the "if" part of the statement) and 'Q' is the consequent (the "then" part). For example, in "If you give me ten dollars, then I will be your best friend," the claim "you give me ten dollars" is the antecedent of the conditional, and "I will be your best friend" is the consequent.

In traditional logic, a statement if A then B is true if and only if either A is false or B is true, or both are false. There have been attempts in areas such as modal logic to find a formal definition that is closer to the 'intuitive' meaning: in the traditional logic interpretation "If it is raining now, then I am a unicorn." is true provided it is not raining now.

2 Truth table

The truth value of expressions involving → is often defined by the following truth table:

pqp → q
TTT
TFF
FTT
FFT

3 Derivation from axioms

This table needn't be taken as "the definition of →", however, because its contents can also be derived from the axioms of the propositional calculus.

We can derive the first row as follows:

  1. Suppose p and q. Under this assumption:
    1. q (by Conjunction elimination)
    2. Suppose p. Under this assumption:
      1. q (copying 1.1)
    3. Thus p → q ( Conditional proof)
  2. Thus (p and q) implies p → q ( Conditional proof)

The second row as follows:

  1. Suppose p and ¬q. Under this assumption:
    1. ¬q (by Conjunction elimination)
    2. Suppose p → q. Under this assumption:
      1. q ( Modus ponens)
      2. ¬q (Copying from above)
      3. q and ¬q ( Conjunction introduction)
    3. Since this is a contradiction, then ¬(p → q).
  2. Thus (p and ¬q) implies ¬(p → q) ( Conditional proof)

The third row as follows:

  1. Suppose ¬p and q. Under this assumption:
    1. q (by Conjunction elimination)
    2. Suppose p. Under this assumption:
      1. q (Copying from above)
    3. Thus p → q ( Conditional proof)
  2. Thus (¬p and q) implies (p → q)

And the fourth row as follows:

  1. Suppose ¬p and ¬q. Under this assumption:
    1. ¬q (by Conjunction elimination)
    2. Suppose p. Under this assumption:
      1. ¬q (Copying from above)
    3. Thus p → ¬q ( Conditional proof)
  2. Thus (¬p and ¬q) implies (p → q)

In the case that the hypothesis is true, the result is the same as conclusion. Otherwise, the whole statement is true regardless the value of conclusion.



Read more »

Non User