4.2 Conditional Logic, Truth Tables, and Contrapositives

Key Takeaways

  • A conditional proposition P→QP \rightarrow Q posits that the antecedent PP is a sufficient condition for the consequent QQ, and that QQ is a necessary condition for PP.

  • The contrapositive (¬Q→¬P\neg Q \rightarrow \neg P) is the only related conditional that is logically equivalent to the original statement (P→Q≡¬Q→¬PP \rightarrow Q \equiv \neg Q \rightarrow \neg P), possessing an identical truth table.

  • Modus Ponens (affirming the antecedent) and Modus Tollens (denying the consequent) represent the two fundamental valid deduction rules in conditional logic.

  • Affirming the consequent (Q⊢PQ \vdash P) and denying the antecedent (¬P⊢¬Q\neg P \vdash \neg Q) are formal propositional fallacies that fail to guarantee the truth of the conclusion.

  • Multi-step conditional arguments can be evaluated by chaining implications (P→Q→RP \rightarrow Q \rightarrow R) and substituting contrapositive bridges when negated conditions appear.

Last updated: October 2026

4.2 Conditional Logic, Truth Tables, and Contrapositives

Note

Conditional reasoning is the foundational architecture of analytical problem solving on the CB-NCAE. Many test items that appear to be complex verbal or technical scenarios are simply chained propositional statements in disguise. Mastering formal symbolic notation and contrapositive conversion allows you to dismantle multi-sentence logic puzzles in under 45 seconds.

In propositional logic, statements are evaluated based on the truth value of their component claims and the logical operators connecting them. A conditional proposition—colloquially expressed as an "If–Then" statement—is symbolized as:

P→QP \rightarrow Q

where PP is the antecedent (the hypothesis, premise, or triggering condition) and QQ is the consequent (the conclusion, result, or necessary outcome).


Sufficient vs. Necessary Conditions

Understanding the precise distinction between sufficient and necessary conditions is paramount for avoiding classic deductive traps:

  1. Sufficient Condition (PP): A condition whose presence guarantees the occurrence of the outcome. If PP is satisfied, QQ must inevitably happen.

    • Example: Scoring 99% on the national qualifying examination is sufficient to secure an interview. (Having the score guarantees the interview).
    • Formula: P→QP \rightarrow Q
  2. Necessary Condition (QQ): A condition that must be present for the outcome to occur, but whose presence does not by itself guarantee the outcome. Without QQ, PP is completely impossible.

    • Example: Being at least 18 years of age is necessary to vote in national elections. (If you are not 18, you cannot vote; but being 18 does not automatically make you a registered voter).
    • Formula: ¬Q→¬P\neg Q \rightarrow \neg P (which is logically equivalent to P→QP \rightarrow Q)

Translating Natural Language into P→QP \rightarrow Q

Test items express conditional relationships in many ways:

  • "PP implies QQ"   ⟹  P→Q\implies P \rightarrow Q
  • "QQ whenever PP"   ⟹  P→Q\implies P \rightarrow Q
  • "PP only if QQ"   ⟹  P→Q\implies P \rightarrow Q (Notice: "Only if" introduces the necessary condition QQ!)
  • "QQ is required for PP"   ⟹  P→Q\implies P \rightarrow Q
  • "No PP without QQ"   ⟹  P→Q\implies P \rightarrow Q
  • "Unless QQ, not PP"   ⟹  P→Q\implies P \rightarrow Q
  • "Unless PP, QQ"   ⟹  ¬P→Q\implies \neg P \rightarrow Q

Truth Table Mechanics of Material Implication

A conditional proposition P→QP \rightarrow Q makes a very specific contractual claim: it asserts that it is impossible for PP to be true while QQ is false. If PP occurs and QQ fails to occur, the conditional statement has been violated (False). Under all other circumstances, the conditional statement remains logically True.

Truth Table for Implication and Related Conditionals

PPQQ¬P\neg P¬Q\neg QConditional: P→QP \rightarrow QConverse: Q→PQ \rightarrow PInverse: ¬P→¬Q\neg P \rightarrow \neg QContrapositive: ¬Q→¬P\neg Q \rightarrow \neg P
TTFFTTTT
TFFTFTTF
FTTFTFFT
FFTTTTTT

The Principle of Vacuous Truth

Notice rows 3 and 4 of the truth table: when the antecedent PP is False, the conditional P→QP \rightarrow Q is automatically True, regardless of whether QQ is true or false. In formal logic, this is called vacuous truth. If the condition PP never occurred, the rule was never broken. For instance, if a teacher promises "If it rains tomorrow, we will conduct class online," and it does not rain, the teacher has not broken their word whether class is held online or in person.


The Four Conditionals and Logical Equivalence

From any original conditional proposition P→QP \rightarrow Q, three related propositions can be derived by switching the order of terms, negating the terms, or doing both:

  1. The Original Conditional: P→QP \rightarrow Q
    • Example: If an organism is a vertebrate, then it possesses a spinal cord.
  2. The Converse: Q→PQ \rightarrow P (Reverses the direction)
    • Example: If an organism possesses a spinal cord, then it is a vertebrate.
  3. The Inverse: ¬P→¬Q\neg P \rightarrow \neg Q (Negates both terms)
    • Example: If an organism is not a vertebrate, then it does not possess a spinal cord.
  4. The Contrapositive: ¬Q→¬P\neg Q \rightarrow \neg P (Reverses the direction AND negates both terms)
    • Example: If an organism does not possess a spinal cord, then it is not a vertebrate.

The Fundamental Law of Contraposition

Inspecting the truth table reveals an indispensable mathematical identity:

P→Q≡¬Q→¬PP \rightarrow Q \equiv \neg Q \rightarrow \neg P

The original conditional and its contrapositive have identical truth values across all possible scenarios. They are logically equivalent statements expressing the exact same factual relationship in two different ways.

Important

Neither the Converse (Q→PQ \rightarrow P) nor the Inverse (¬P→¬Q\neg P \rightarrow \neg Q) is logically equivalent to the original conditional statement. However, the converse and the inverse are logically equivalent to each other (Q→P≡¬P→¬QQ \rightarrow P \equiv \neg P \rightarrow \neg Q). Assuming that P→QP \rightarrow Q implies Q→PQ \rightarrow P is one of the most widespread reasoning fallacies tested on aptitude examinations.


Valid Inference Rules vs. Formal Propositional Fallacies

When a conditional premise is paired with a secondary factual premise, only two inferential forms produce logically valid conclusions. The other two configurations are formal deductive fallacies.

Valid Rule 1: Modus Ponens (Affirming the Antecedent)

  • Structure: Premise 1:P→QPremise 2:PConclusion:∴Q\begin{array}{ll} \text{Premise 1:} & P \rightarrow Q \\ \text{Premise 2:} & P \\ \hline \text{Conclusion:} & \therefore Q \end{array}
  • Explanation: If the sufficient condition has occurred, the consequence is guaranteed.
  • Example: If a student completes all core STEM competencies (PP), they are eligible for the regional science fair (QQ). Joshua completed all core STEM competencies (PP). Therefore, Joshua is eligible for the regional science fair (QQ). [VALID]

Valid Rule 2: Modus Tollens (Denying the Consequent)

  • Structure: Premise 1:P→QPremise 2:¬QConclusion:∴¬P\begin{array}{ll} \text{Premise 1:} & P \rightarrow Q \\ \text{Premise 2:} & \neg Q \\ \hline \text{Conclusion:} & \therefore \neg P \end{array}
  • Explanation: If the necessary condition failed to occur, the sufficient condition could not possibly have happened (relying directly on the contrapositive ¬Q→¬P\neg Q \rightarrow \neg P).
  • Example: If a computer system detects an unauthorized network breach (PP), an automated security lockdown is triggered (QQ). No automated security lockdown was triggered (¬Q\neg Q). Therefore, the computer system did not detect an unauthorized network breach (¬P\neg P). [VALID]

Formal Fallacy 1: Affirming the Consequent (Invalid!)

  • Flawed Structure: Premise 1:P→QPremise 2:QFlawed Conclusion:∴P(INVALID!)\begin{array}{ll} \text{Premise 1:} & P \rightarrow Q \\ \text{Premise 2:} & Q \\ \hline \text{Flawed Conclusion:} & \therefore P \quad \text{(INVALID!)} \end{array}
  • Explanation: Confuses a necessary condition with a sufficient condition. Knowing that the outcome QQ occurred does not prove that PP was the specific cause; QQ could have been triggered by other independent factors.
  • Example: If it rains heavily in Metro Manila (PP), the low-lying avenues will flood (QQ). The low-lying avenues are flooded (QQ). Therefore, it rained heavily in Metro Manila (PP). [INVALID! The avenues could be flooded due to a burst water main, blocked drainage culverts, or tidal storm surges].

Formal Fallacy 2: Denying the Antecedent (Invalid!)

  • Flawed Structure: Premise 1:P→QPremise 2:¬PFlawed Conclusion:∴¬Q(INVALID!)\begin{array}{ll} \text{Premise 1:} & P \rightarrow Q \\ \text{Premise 2:} & \neg P \\ \hline \text{Flawed Conclusion:} & \therefore \neg Q \quad \text{(INVALID!)} \end{array}
  • Explanation: Assumes that PP is the only possible condition that could produce QQ. Denying PP does not prevent QQ from occurring through alternative mechanisms.
  • Example: If a candidate receives an academic endorsement from the alumni board (PP), they pass the screening stage (QQ). Candidate Elena did not receive an academic endorsement from the alumni board (¬P\neg P). Therefore, Elena will not pass the screening stage (¬Q\neg Q). [INVALID! Elena could pass the screening stage based on a competitive entrance examination score or artistic portfolio].

Chained Conditionals and Hypothetical Syllogisms

When multiple conditional statements are linked together, they exhibit a transitive property known in formal logic as the Hypothetical Syllogism:

Premise 1:P→QPremise 2:Q→RConclusion:∴P→R(and by contraposition, ¬R→¬P)\begin{array}{ll} \text{Premise 1:} & P \rightarrow Q \\ \text{Premise 2:} & Q \rightarrow R \\ \hline \text{Conclusion:} & \therefore P \rightarrow R \quad (\text{and by contraposition, } \neg R \rightarrow \neg P) \end{array}

Bridging Broken Chains with Contrapositives

Exam questions deliberately disrupt chains by stating intermediate premises in negative or inverted forms. When you encounter a broken chain, immediately convert the disrupted premise into its contrapositive to restore the link:

Scenario:

  • Statement 1: If a high school graduate enters a naval architecture program (AA), they must master fluid mechanics (BB). Form: A→BA \rightarrow B
  • Statement 2: If a student does not master multivariable calculus (CC), they cannot master fluid mechanics (BB). Form: ¬C→¬B\neg C \rightarrow \neg B
  • Statement 3: If a student masters multivariable calculus (CC), they pass the technical foundation review (DD). Form: C→DC \rightarrow D

Resolution Workflow:

  1. Examine Statement 2: ¬C→¬B\neg C \rightarrow \neg B.
  2. Take its contrapositive: B→CB \rightarrow C.
  3. Now link all statements smoothly: A→B→C→DA \rightarrow B \rightarrow C \rightarrow D
  4. Guaranteed Valid Deductions:
    • If a student enters naval architecture, they pass the technical foundation review (A→DA \rightarrow D).
    • If a student does not pass the technical foundation review, they did not enter naval architecture (¬D→¬A\neg D \rightarrow \neg A).
    • If a student enters naval architecture, they master multivariable calculus (A→CA \rightarrow C).

Biconditional Statements ("If and Only If")

A biconditional proposition asserts that two statements are mutually necessary and sufficient for one another. It is symbolized as:

P↔QP \leftrightarrow Q

which is logically equivalent to the conjunction of two conditionals: (P→Q)∧(Q→P)(P \rightarrow Q) \wedge (Q \rightarrow P).

  • In natural language: "PP if and only if QQ" (often abbreviated as "PP iff QQ").
  • Under a biconditional, both the converse and the inverse are fully valid! If PP occurs, QQ must occur; if QQ occurs, PP must occur; if either is absent, the other must be absent.

Step-by-Step Worked Problems

Worked Example 1: Multi-Link Academic Track Prerequisite Chain

Problem: Consider the following institutional curriculum guidelines:

  1. If a student enrolls in the Robotics Specialization (RR), they must take Microcontroller Programming (MM).
  2. If a student takes Microcontroller Programming (MM), they must complete Digital Logic Design (DD).
  3. If a student does not complete Advanced Circuit Analysis (AA), they cannot complete Digital Logic Design (DD).
  4. Kenneth is enrolled in the Robotics Specialization.

What can be definitively concluded regarding Kenneth?

Step-by-Step Solution:

  1. Symbolize each premise:
    • Premise 1: R→MR \rightarrow M
    • Premise 2: M→DM \rightarrow D
    • Premise 3: ¬A→¬D\neg A \rightarrow \neg D
    • Premise 4: R(Kenneth)=TrueR(\text{Kenneth}) = \text{True}
  2. Convert Premise 3 using contraposition: ¬A→¬D≡D→A\neg A \rightarrow \neg D \equiv D \rightarrow A
  3. Construct the unified deductive chain: R→M→D→AR \rightarrow M \rightarrow D \rightarrow A
  4. Apply Modus Ponens:
    • Kenneth is in Robotics (RR).
    • Therefore, Kenneth must take Microcontroller Programming (MM), must complete Digital Logic Design (DD), and must complete Advanced Circuit Analysis (AA).
    • By contraposition, anyone who did not complete Advanced Circuit Analysis (¬A\neg A) is not enrolled in Robotics (¬R\neg R).

Worked Example 2: Distinguishing Valid Inferences from Fallacies

Premises:

  • Rule: If a municipal water reservoir experiences an algal bloom (AA), the regional treatment facility increases chlorine dosing by 40% (CC).
  • Observation: Yesterday, the regional treatment facility increased chlorine dosing by 40%.
  • Candidate Conclusion: Therefore, the municipal water reservoir experienced an algal bloom.

Step-by-Step Solution:

  1. Formalize the structure:
    • Premise 1: A→CA \rightarrow C
    • Premise 2: CC (The facility increased chlorine dosing)
    • Conclusion: ∴A\therefore A
  2. Evaluate the validity:
    • Premise 2 affirms the consequent (CC).
    • Increasing chlorine dosing was a necessary consequence of an algal bloom, but not exclusively so. The facility could have increased chlorine dosing due to heavy monsoon turbidity, bacterial contamination from agricultural runoff, or routine maintenance pipe disinfection.
  3. Deductive Verdict: The argument commits the Fallacy of Affirming the Consequent. The conclusion is plausible but logically unproven.
Test Your Knowledge

Consider the following three institutional rules:

  1. If a student enrolls in the Advanced Physics elective, they must take Differential Calculus.
  2. If a student does not take Differential Calculus, they cannot enroll in Linear Algebra.
  3. Mateo is currently enrolled in Linear Algebra.

Which of the following must be true based strictly on these rules?

A

Students enrolled in Differential Calculus must enroll in Advanced Physics.

B

Mateo is not enrolled in Differential Calculus.

C

Mateo is enrolled in the Advanced Physics elective.

D

Mateo is taking Differential Calculus.

Test Your Knowledge

A robotics coach establishes the rule: 'If a student designs an autonomous navigation algorithm, then the student passes the technical assessment.' Later, the coach observes that Sofia passed the technical assessment and concludes: 'Therefore, Sofia designed an autonomous navigation algorithm.' What logical error did the coach commit?

A

Fallacy of Affirming the Consequent

B

Hypothetical Syllogism

C

Modus Tollens

D

Fallacy of Denying the Antecedent

Test Your Knowledge

Which of the following statements is logically equivalent to the proposition: 'If a marine sanctuary is not strictly protected against unauthorized commercial fishing, then its coral reef biodiversity will deteriorate'?

A

A marine sanctuary will maintain its coral reef biodiversity even if it is not strictly protected.

B

If a marine sanctuary is strictly protected against unauthorized commercial fishing, then its coral reef biodiversity will not deteriorate.

C

If a marine sanctuary's coral reef biodiversity does not deteriorate, then it is strictly protected against unauthorized commercial fishing.

D

If a marine sanctuary's coral reef biodiversity deteriorates, then it was not strictly protected against unauthorized commercial fishing.

Sections you finish are checked off in the contents.