Lesson PROOF OF THE FALLACY OF THE CONVERSE

Source code of 'PROOF OF THE FALLACY OF THE CONVERSE'

This Lesson (PROOF OF THE FALLACY OF THE CONVERSE) was created by by Theo(13342)

This proof uses the law of equivalence.

The law of equivalence states:

If two statements have the same truth values for all possible conditions in the truth table, then the statements are equivalent and can be used inter-changeably.

The fallacy of the converse involves the use of the implies statement.

The implies statement is symbolically shown as:

p -> q

This means that:

If p is true, then q must be true in order for the implies statement to be true.

This logic only applies if p is true.
If p is false, then q can be true or false without making the implies statement false because the necessary condition for proving the implies statement is false is that p is true.

The truth table for the implies statement is shown below:

<pre>
          p    q    (p -> q)
          -    -    --------

T    T       T
          T    F       F
          F    T       T
          F    F       T
</pre>

If p is true and q is true, then the implies statement is true.
If p is true and q is false, then the implies statement is false.
If p is false, then the implies statement is true regardless of whether q is true or false.

The converse of the implies statement is symbolically shown as:

q -> p

The fallacy of the converse states that:

THE ASSUMPTION THAT THE CONVERSE OF THE IMPLIES STATEMENT IS EQUIVALENT TO THE IMPLIES STATEMENT IS FALSE.

In order to prove the fallacy of the converse, we assume that the converse of the implies statement is equivalent to the implies statement and then show that it can't be because it violates the law of equivalence.

We start with the assumption that:

q -> p is equivalent to p -> q

What this means is:

If p implies q is true, then q implies p is also true.
If p implies q is false, then q implies p is also false.

The truth table for the converse of the implies statement is shown below:

<pre>
          p    q    (p -> q)   (q -> p)
          -    -    --------   --------

T    T       T          T
          T    F       F          T
          F    T       T          F
          F    F       T          T
</pre>

If (p -> q) is to be equivalent to (q -> p), then they both must have the same truth values for all possible conditions in the truth table.

Equivalence means that their truth values agree for all possible conditions in the truth table.
If both are true or if both are false, then the equivalence statement is true.  
If one is true and the other is false, then the equivalence statement is false.

You can immediately see that they do not have the same truth values for all possible conditions in the truth table, but we will show that through the use of the equivalency statement.

The equivalency statement is symbolically shown as:

(p -> q) <-> (q -> p)

<-> translates to "is equivalent to"

The truth table for (p -> q) <-> (q -> p) is shown below:

Each row is a condition of the truth table.
There are four possible conditions to be tested.
This is because we are dealing with two variables with two possible truth values each.
The variables are p and q.
The possible conditions are:
p is true and q is true.
p is true and q is false.
p is false and q is true.
p is false and q is false.
There are no other possible conditions involving these two variables.

The truth table for the equivalency statement is not true for all conditions.
Look at the second and third rows in the equivalency statement of the truth table.
The truth table values for (p -> q) and (q -> p) do not agree.
This violates the requirements of the law of equivalency.

This proves that the two statements of (p -> q) and (~q -> ~p) are not equivalent.

This is called the fallacy of the converse.

It means that any assumption that the statement p -> q is equivalent to q -> p is false.

If you are given an argument such as:

p -> q
q
therefore p

then you can immediately reject it by reason of the fallacy of the converse.