7.4 Converses, Inverses, Contrapositives, Equivalence & Valid Arguments
Key Takeaways
- For a conditional statement $p \rightarrow q$: the Converse is $q \rightarrow p$, the Inverse is $\neg p \rightarrow \neg q$, and the Contrapositive is $\neg q \rightarrow \neg p$.
- A conditional is logically equivalent ONLY to its contrapositive ($p \rightarrow q \equiv \neg q \rightarrow \neg p$), and the converse is logically equivalent to the inverse ($q \rightarrow p \equiv \neg p \rightarrow \neg q$).
- The negation of a conditional statement is a conjunction: $\neg(p \rightarrow q) \equiv p \land \neg q$ ("$p$ is true and $q$ is false").
- Valid deductive argument forms include Modus Ponens ($p \rightarrow q, p \vdash q$), Modus Tollens ($p \rightarrow q, \neg q \vdash \neg p$), Hypothetical Syllogism ($p \rightarrow q, q \rightarrow r \vdash p \rightarrow r$), and Disjunctive Syllogism ($p \lor q, \neg p \vdash q$).
- Common deductive fallacies include Affirming the Consequent ($p \rightarrow q, q \vdash p$) and Denying the Antecedent ($p \rightarrow q, \neg p \vdash \neg q$), both of which are invalid argument structures.
7.4 Converses, Inverses, Contrapositives, Equivalence & Valid Arguments
Evaluating the validity of deductive reasoning is a core skill on the CLEP College Mathematics examination. Questions regularly require converting conditional statements into their converses, inverses, and contrapositives, negating compound expressions via De Morgan's Laws, and distinguishing valid argument forms (such as Modus Ponens and Modus Tollens) from formal logical fallacies.
1. The Four Conditional Variations
Given an original conditional statement $p \rightarrow q$, three related conditional statements can be formed by reversing, negating, or both reversing and negating the components.
+-----------------------------------------------------------------------------+
| THE FOUR RELATED CONDITIONAL STATEMENTS |
| |
| Statement Name Symbolic Form How to Form from p -> q |
| -------------- ------------- ----------------------- |
| Conditional p -> q Given (If p, then q) |
| Converse q -> p SWITCH hypothesis and conclusion |
| Inverse ~p -> ~q NEGATE hypothesis and conclusion |
| Contrapositive ~q -> ~p SWITCH AND NEGATE both |
+-----------------------------------------------------------------------------+
Complete Truth Table Comparison
| $p$ | $q$ | $\neg p$ | $\neg q$ | Conditional: $p \rightarrow q$ | Converse: $q \rightarrow p$ | Inverse: $\neg p \rightarrow \neg q$ | Contrapositive: $\neg q \rightarrow \neg p$ |
|---|---|---|---|---|---|---|---|
| T | T | F | F | T | T | T | T |
| T | F | F | T | F | T | T | F |
| F | T | T | F | T | F | F | T |
| F | F | T | T | T | T | T | T |
Logical Equivalence ($\equiv$)
Two compound statements are logically equivalent ($P \equiv Q$) if they have identical truth values in every row of their truth table.
From the truth table above:
- Conditional $\equiv$ Contrapositive:
- Converse $\equiv$ Inverse:
- Non-Equivalence:
- A conditional is NOT equivalent to its converse: $p \rightarrow q \not\equiv q \rightarrow p$
- A conditional is NOT equivalent to its inverse: $p \rightarrow q \not\equiv \neg p \rightarrow \neg q$
[!IMPORTANT] If an original conditional statement is True, its contrapositive is guaranteed to be True. However, its converse and inverse may be False.
2. Negation of Conditionals & De Morgan's Laws
Negation of a Conditional Statement
To negate an implication, identify the condition under which $p \rightarrow q$ is False (when $p$ occurs and $q$ fails to occur):
- Example: Negating "If it rains, then the match is canceled" yields "It rains AND the match is NOT canceled."
- Notice that the negation of an "if-then" statement is NOT an "if-then" statement; it is a conjunction (AND).
Material Implication Identity
A conditional statement can be expressed as a disjunction:
De Morgan's Laws for Logic
- Negation of Conjunction: $\neg(p \land q) \equiv \neg p \lor \neg q$
- Negation of Disjunction: $\neg(p \lor q) \equiv \neg p \land \neg q$
3. Deductive Arguments & Formal Validity
An argument consists of a set of declarative statements called premises ($P_1, P_2, \dots, P_k$) and a concluding statement called the conclusion ($C$).
Definition of Validity
An argument is valid if and only if it is logically impossible for all premises to be True while the conclusion is False. In truth table terms, the conditional $(P_1 \land P_2 \land \dots \land P_k) \rightarrow C$ must be a tautology.
- Soundness: An argument is sound if it is valid AND all of its premises are factually true in the real world.
4. Standard Valid Argument Forms
+-----------------------------------------------------------------------------+
| FOUR VALID DEDUCTIVE ARGUMENT FORMS |
| |
| 1. MODUS PONENS (Law of Detachment): |
| Premise 1: p -> q |
| Premise 2: p |
| Conclusion: therefore q |
| |
| 2. MODUS TOLLENS (Law of Contraposition): |
| Premise 1: p -> q |
| Premise 2: ~q |
| Conclusion: therefore ~p |
| |
| 3. HYPOTHETICAL SYLLOGISM (Chain Rule): |
| Premise 1: p -> q |
| Premise 2: q -> r |
| Conclusion: therefore p -> r |
| |
| 4. DISJUNCTIVE SYLLOGISM: |
| Premise 1: p v q |
| Premise 2: ~p |
| Conclusion: therefore q |
+-----------------------------------------------------------------------------+
Examples of Valid Deductions
- Modus Ponens Example:
- Premise 1: If a polygon is a regular hexagon, the sum of its interior angles is $720^\circ$.
- Premise 2: Polygon $H$ is a regular hexagon.
- Conclusion: Therefore, the sum of the interior angles of $H$ is $720^\circ$. (Valid)
- Modus Tollens Example:
- Premise 1: If an integer is divisible by $6$, it is divisible by $2$.
- Premise 2: Integer $n$ is not divisible by $2$.
- Conclusion: Therefore, integer $n$ is not divisible by $6$. (Valid)
5. Invalid Argument Forms (Formal Fallacies)
The CLEP exam frequently includes questions designed to test whether you can recognize common formal fallacies.
+-----------------------------------------------------------------------------+
| TWO COMMON FORMAL FALLACIES |
| |
| 1. FALLACY OF AFFIRMING THE CONSEQUENT (Invalid!): |
| Premise 1: p -> q |
| Premise 2: q |
| Conclusion: therefore p <-- INVALID! |
| |
| 2. FALLACY OF DENYING THE ANTECEDENT (Invalid!): |
| Premise 1: p -> q |
| Premise 2: ~p |
| Conclusion: therefore ~q <-- INVALID! |
+-----------------------------------------------------------------------------+
Fallacy Analysis & Counterexamples
- Affirming the Consequent:
- Argument: "If it is raining ($p$), the sidewalk is wet ($q$). The sidewalk is wet ($q$). Therefore, it is raining ($p$)."
- Counterexample: A garden sprinkler or fire hydrant could have wet the sidewalk without rain.
- Denying the Antecedent:
- Argument: "If you study 100 hours ($p$), you will pass the CLEP ($q$). You did not study 100 hours ($\neg p$). Therefore, you will not pass the CLEP ($\neg q$)."
- Counterexample: A student might pass with 60 hours of study or strong prior knowledge.
6. Worked Examples
Worked Example 1: Constructing Variations of a Real Statement
Problem: Consider the conditional: "If $x = 4$, then $x^2 = 16$." State the converse, inverse, and contrapositive, and evaluate the truth value of each.
Solution:
- Original Conditional ($p \rightarrow q$): "If $x = 4$, then $x^2 = 16$." (True)
- Converse ($q \rightarrow p$): "If $x^2 = 16$, then $x = 4$." (False, counterexample: $x = -4$)
- Inverse ($\neg p \rightarrow \neg q$): "If $x \neq 4$, then $x^2 \neq 16$." (False, counterexample: $x = -4$ has $(-4)^2 = 16$)
- Contrapositive ($\neg q \rightarrow \neg p$): "If $x^2 \neq 16$, then $x \neq 4$." (True, logically equivalent to original conditional)
Worked Example 2: Testing Validity Using Symbolic Forms
Problem: Determine whether the following argument is valid or invalid:
- Premise 1: $p \rightarrow \neg q$
- Premise 2: $q$
- Conclusion: $\neg p$
Solution:
- By contrapositive equivalence, Premise 1 ($p \rightarrow \neg q$) is equivalent to $\neg(\neg q) \rightarrow \neg p$, which simplifies to $q \rightarrow \neg p$.
- The argument now reads:
- Premise 1: $q \rightarrow \neg p$
- Premise 2: $q$
- Conclusion: $\neg p$
- This matches the standard Modus Ponens structure with respect to variable $q$.
- Conclusion: The argument is VALID.
7. Common CLEP Traps & Strategic Checkpoints
- Trap 1: Assuming a True Conditional Has a True Converse: Never assume $q \rightarrow p$ is True just because $p \rightarrow q$ is True. The converse and inverse are NOT logically equivalent to the original conditional.
- Trap 2: Negating a Conditional as an If-Then: The negation of $p \rightarrow q$ is NOT $\neg p \rightarrow \neg q$. The negation is $p \land \neg q$.
- Trap 3: Confusing Modus Tollens with Denying the Antecedent:
- Modus Tollens negates the conclusion ($p \rightarrow q, \neg q \vdash \neg p$) and is VALID.
- Denying the Antecedent negates the hypothesis ($p \rightarrow q, \neg p \vdash \neg q$) and is INVALID.
- Trap 4: Confusing Validity with Factual Truth: An argument can be valid even if its premises are factually absurd (e.g., "All birds are reptiles; all reptiles fly; therefore all birds fly"). Validity refers strictly to logical structure.
Consider the statement: "If a quadrilateral is a square, then it has four congruent sides." Which of the following is the logically equivalent CONTRAPOSITIVE of this statement?
What is the formal logical negation of the conditional statement: "If it rains on Saturday ($p$), then the outdoor concert will be canceled ($q$)"?
Consider the following deductive argument: Premise 1: If a student scores 50 or higher on the CLEP exam, they earn college credit ($p \rightarrow q$). Premise 2: Marcus earned college credit ($q$). Conclusion: Therefore, Marcus scored 50 or higher on the CLEP exam ($p$). Which of the following correctly classifies this argument structure?