Conditional Logic & Formal Reasoning

What You Need to Know

Conditional logic is the LSAT’s language for linking ideas with if–then relationships. Formal reasoning is the skill of translating English into precise logical form (conditionals, quantifiers, negations) and drawing only what must follow.

Why it matters: it drives many Logical Reasoning question types (Must Be True, Sufficient Assumption, Necessary Assumption, Flaw, Parallel, Inference), and it’s the backbone of clean diagramming in conditional-heavy setups.

Core idea (the rule you live by)

A conditional statement has:

• Sufficient condition (trigger): what must happen first.
• Necessary condition (requirement): what must be true if the trigger happens.

Write it as:
$A \rightarrow B$
Read: If $A$, **then** $B$.

Key implications:

• From $A \rightarrow B$ you may infer its contrapositive:
  $\neg B \rightarrow \neg A$
• You may not infer the converse or inverse:
  $B \rightarrow A$
  $\neg A \rightarrow \neg B$

Your #1 job: translate accurately, then use contraposition + chaining to make valid inferences.

Step-by-Step Breakdown

A. Translating English into conditionals (the LSAT way)

1. Identify the indicator word (if, only if, unless, without, until, requires, depends).
2. Find the sufficient condition (often right after “if,” “when,” “whenever,” “each,” “any”).
3. Find the necessary condition (often right after “then,” or introduced by “only if,” “requires,” “depends on,” “must”).
4. Diagram cleanly with consistent symbols.
5. Immediately write the contrapositive for anything that looks chainable.

Micro-examples (translation)

• “If you submit late, you lose points.”
  $L \rightarrow P$
• “You lose points only if you submit late.”
  $P \rightarrow L$
• “Submitting late is sufficient to lose points.”
  $L \rightarrow P$
• “Submitting late is necessary to lose points.”
  $P \rightarrow L$

B. Contraposition (automatic)

1. Swap the two terms.
2. Negate both.

Example:
$A \rightarrow B$
Contrapositive:
$\neg B \rightarrow \neg A$

Negation tips:

• $\neg(\text{not }X) = X$
• $\neg(\text{all}) = \text{not all}$ (often becomes “some not”)
• $\neg(\text{some}) = \text{none}$

C. Chaining (linking multiple conditionals)

1. Look for a middle term that matches:
   $A \rightarrow B$
   $B \rightarrow C$
2. Chain to get:
   $A \rightarrow C$
3. Also chain contrapositives when useful.

Worked chain:

• Premises:
  $A \rightarrow B$
  $B \rightarrow C$
• Inference:
  $A \rightarrow C$
• Contrapositive of the inference:
  $\neg C \rightarrow \neg A$

D. Handling “unless,” “without,” and “until”

These are common LSAT translation traps.

Method (reliable):

1. Rewrite “$P$ unless $Q$” as “If not $Q$, then $P$.”
2. Equivalent form: “If not $P$, then $Q$.”

Example:

• “You won’t pass unless you study.”
  • “If you don’t study, you won’t pass”:
    $\neg S \rightarrow \neg P$
  • Equivalent:
    $P \rightarrow S$

“Without” usually means “if not”:

• “No success without effort.”
  $\neg E \rightarrow \neg U$ (where $U$ = success)
  Equivalent:
  $U \rightarrow E$

“Until” often sets a necessary condition for stopping:

• “You won’t relax until you finish.”
  If you relax, you must have finished:
  $R \rightarrow F$

For “until,” ask: what must be true for the later thing to occur?

E. Using conditionals in LR question tasks

1. Must Be True / Inference: chain what you have; take contrapositives; pick the choice that is guaranteed.
2. Necessary Assumption: look for what the argument requires; use the Negation Test (negate the choice; if the argument falls apart, it was necessary).
3. Sufficient Assumption: look for a missing link; often you need to complete a chain to force the conclusion.
4. Flaw: watch for confusing sufficient with necessary (classic).

Key Formulas, Rules & Facts

Conditional logic essentials

Common indicator words (translation triggers)

Quantifiers (formal reasoning)

Quantifiers show up a lot in “formal logic” stimuli.

Treat “some” as “at least one.” It never justifies a universal conclusion.

De Morgan’s laws (negating compound statements)

Use these when negating answer choices (Necessary Assumption) or spotting formal fallacies.

$\neg(A \wedge B) \leftrightarrow (\neg A \vee \neg B)$
$\neg(A \vee B) \leftrightarrow (\neg A \wedge \neg B)$

Valid vs. invalid argument forms

Examples & Applications

Example 1: “Only if” (necessary condition)

Stimulus: “A building gets a permit only if it meets the safety code.”

Setup:

• $P$ = gets a permit
• $S$ = meets safety code

Diagram:
$P \rightarrow S$
Contrapositive:
$\neg S \rightarrow \neg P$

Key insight: “Only if” introduces what must be true for the first thing to happen.

Example 2: “Unless” (two equivalent conditionals)

Stimulus: “The team will not win unless it practices.”

Setup:

• $W$ = win
• $R$ = practice

Translate:

• If not practice, then not win:
  $\neg R \rightarrow \neg W$
• Equivalent:
  $W \rightarrow R$

Key insight: This often helps you connect to other premises that mention $W$.

Example 3: Chain + contrapositive in an inference question

Premises:

1. “If the report is audited, the errors will be found.”
   $A \rightarrow E$
2. “If errors are found, the report will be revised.”
   $E \rightarrow R$

Inference:
$A \rightarrow R$

Also useful:

• Contrapositive of premise 2:
  $\neg R \rightarrow \neg E$
• Then contrapositive chain:
  $\neg R \rightarrow \neg A$

Key insight: Many MBT answers are just the endpoints of a chain, sometimes in contrapositive form.

Example 4: Quantifiers and negation (formal reasoning)

Statement: “All efficient engines are quiet.”

Diagram:
$E \rightarrow Q$

Negation (what it means to deny it):

• “Not all efficient engines are quiet,” i.e., “Some efficient engines are not quiet.”

Formal:
$\exists x\,(E \wedge \neg Q)$

Key insight: The negation of “all” is some not, not “none.”

Common Mistakes & Traps

1. Mixing up sufficient vs. necessary: You treat a requirement as a trigger (or vice versa). This flips the arrow and wrecks chains. Fix: circle indicators: “only if,” “requires,” “depends” almost always point to the necessary side.

2. Taking the converse/inverse as valid: From $A \rightarrow B$ you assume $B \rightarrow A$ or $\neg A \rightarrow \neg B$. Why wrong: those are different claims. Fix: only two safe moves: modus ponens and modus tollens.

3. Forgetting the contrapositive exists: You see $A \rightarrow B$ but miss $\neg B \rightarrow \neg A$, losing easy inferences. Fix: for any conditional that might matter, write its contrapositive immediately.

4. Mishandling “unless”: You write $P \rightarrow Q$ when you needed $\neg Q \rightarrow P$ (or vice versa). Fix: use the template: “$P$ unless $Q$” becomes $\neg Q \rightarrow P$, and also $\neg P \rightarrow Q$.

5. Over-chaining with non-matching terms: You chain $A \rightarrow B$ with $C \rightarrow D$ because they “sound related.” Why wrong: chaining requires an identical middle term (or clearly defined synonym). Fix: treat terms like variables; match exactly.

6. Illicitly contraposing “some”: You try to contrapositive a statement like “Some $A$ are $B$.” Why wrong: existential claims don’t support contraposition. Fix: only contrapose **universal-style** conditionals (including “all,” “no,” and standard $\rightarrow$ forms).

7. Negating answer choices incorrectly (Necessary Assumption): You negate “some,” “all,” or “or” improperly. Fix: memorize quantifier negations and De Morgan’s.

8. Confusing “most” with “all”: You treat “most” as a conditional $A \rightarrow B$. Why wrong: “most” allows exceptions and doesn’t yield a clean contrapositive. Fix: avoid diagramming “most” as a strict conditional; reason with it qualitatively unless a question demands counting logic.

Memory Aids & Quick Tricks

Quick Review Checklist

• You can label sufficient (trigger) vs. necessary (requirement) quickly.
• You translate “only if,” “requires,” “depends on” as necessary conditions.
• You automatically write the contrapositive: $A \rightarrow B$ gives $\neg B \rightarrow \neg A$.
• You never take the converse or inverse as valid.
• You can handle unless/without/until with consistent templates.
• You chain conditionals only when the middle term matches exactly.
• You know quantifier negations: all $\rightarrow$ **some not**, **some** $\rightarrow$ none.
• You use De Morgan’s laws to negate “and/or” statements correctly.

You’ve got this: be ruthless about translation accuracy, and the inferences get mechanical fast.