LSAT Conditional Logic Chains: How to Link Multiple If-Then Statements

Most students learn individual conditional statements — 'If A, then B' — relatively quickly. The diagram is A → B. The contrapositive is Not-B → Not-A. That part becomes mechanical with practice.

But LSAT questions often present multiple conditional statements that connect to each other. The skill of linking those statements into a chain, and reading the valid conclusions from the full chain, is more advanced — and is where many students lose points on harder Logical Reasoning questions.

A conditional chain is simply a sequence where the necessary condition of one statement is the sufficient condition of the next. A → B, B → C. From this, you can conclude A → C. That transitive inference is what chains allow.

The core rule: if the necessary condition of one conditional matches the sufficient condition of another, you can chain them. The chain follows the arrow through both statements.

Example: 'If the report is late, the meeting is postponed. If the meeting is postponed, the deadline is extended.'

Diagrams: Late report → Postponed meeting. Postponed meeting → Extended deadline.

Chain: Late report → Postponed meeting → Extended deadline.

Valid conclusion from the chain: If the report is late, the deadline is extended. (Late report → Extended deadline.)

This works because every arrow follows the same direction. The middle term — 'postponed meeting' — disappears from the chain. What remains is the connection between the first sufficient condition and the last necessary condition.

Every valid chain has a valid contrapositive. The contrapositive of a chain is formed by negating and reversing the entire chain.

Original chain: A → B → C

Contrapositive of the chain: Not-C → Not-B → Not-A

Applying this to the example: The chain was Late report → Postponed meeting → Extended deadline. The contrapositive chain is: No extended deadline → Meeting not postponed → Report not late.

Each individual link also has its own contrapositive. 'Late report → Postponed meeting' gives you 'Not postponed meeting → Not late report.' 'Postponed meeting → Extended deadline' gives you 'Not extended deadline → Not postponed meeting.'

On LSAT questions, the contrapositive chain is just as valid as the original. If you know the deadline was not extended, you can conclude both that the meeting was not postponed and that the report was not late.

Chains only work in the direction the arrows point. You cannot reverse any step without negating both sides (contrapositive). You cannot skip steps and reverse the chain without applying the contrapositive transformation.

From A → B → C, you cannot conclude: B → A (reversal of the first step). C → B (reversal of the second step). C → A (reversal of the whole chain). B → C → A or any other reordering.

Example trap: 'If the meeting was postponed, can we conclude the report was late?' From the original chain, No. The original states that a late report is sufficient to cause postponement — but a postponement could have other causes. The contrapositive tells you that if the meeting was not postponed, the report was not late. But from a postponement, you cannot conclude a late report caused it.

LSAT wrong answers frequently exploit the reversal — offering a conclusion that would follow if you could reverse the chain, which you cannot. Keep the arrows pointing in only one direction.

Not every set of conditionals can be chained. Two conditionals connect only when the necessary condition of one matches the sufficient condition of the other — or when one of their contrapositives allows the match.

Example that does not chain: 'If A, then B. If C, then B.' Both statements end at B, but they start from different places. From these, you cannot conclude A → C or C → A. All you know is that both A and C each lead to B. The diagram is A → B ← C. These are parallel paths to B, not a chain.

To check whether two conditionals chain: write both diagrams. Can the right side (necessary condition) of one statement match the left side (sufficient condition) of the other — either directly or via a contrapositive? If yes, they chain. If no, they do not.

If you have A → B and C → B, try the contrapositive of the second: Not-B → Not-C. Now does the necessary condition of A → B (which is B) match the sufficient condition of anything? It doesn't match Not-B. So no chain forms from A → B and C → B directly.

Chains can involve negated terms. This is where it gets trickier, but the same rule applies: the necessary condition of one statement must match the sufficient condition of the next.

Example: 'If A, then Not-B. If Not-B, then C.'

Diagrams: A → Not-B. Not-B → C.

The necessary condition of the first (Not-B) matches the sufficient condition of the second (Not-B). Chain: A → Not-B → C. Valid conclusion: A → C.

Now suppose you are told: 'Not-C.' From the contrapositive of the chain (Not-C → Not[Not-B] → Not-A), which simplifies to Not-C → B → Not-A. So if Not-C is true, then B must be true, and A must be false.

These chains with negated terms appear frequently in harder LSAT questions. Draw every term carefully — including whether it is the positive or negative version — to avoid errors.

Step 1: Identify every conditional statement in the stimulus. Translate any non-standard phrasing (only if, unless, no X without Y) into standard if-then form.

Step 2: Draw the diagram for each. Write them vertically so you can see potential connections.

Step 3: Check for links — does any necessary condition match any sufficient condition? Connect those with a chain arrow.

Step 4: Write the full chain. Then write its contrapositive.

Step 5: Compare to the answer choices. The correct inference must follow from the chain or its contrapositive. If an answer requires reversing any step without negating, eliminate it.

This five-step process is especially useful on must-be-true questions and sufficient assumption questions that involve multiple conditionals.

Q: How many conditionals can a chain include? Theoretically as many as the stimulus contains. In practice, LSAT chains rarely involve more than three to four steps. But even a three-step chain with negated terms requires careful diagramming.

Q: Can I use a chain's contrapositive to build new chains? Yes. Contrapositives of individual links can connect to other statements. If A → B and Not-A → C, you can build a chain from Not-B (contrapositive of A → B gives Not-B → Not-A, which connects to Not-A → C). So: Not-B → Not-A → C.

Q: Is conditional chain reasoning only tested in must-be-true questions? No. It appears in sufficient assumption questions (you need a bridge that completes a chain), in flaw questions (the flaw is often the reversal of a chain step), and in method of reasoning questions (the author proceeds by chaining two conditional rules to reach a conclusion).

Q: Does this apply to Reading Comprehension passages? It can. RC passages sometimes contain policy rules or legal conditions that function as conditional statements. Being able to read those as conditionals and trace their implications helps with inference and application questions.

Conditional chain reasoning is one of the skills that separates students who plateau in the mid-range from those who push into the higher end of the LSAT scoring range. The foundational skills — individual conditionals and contrapositives — are necessary but not sufficient. Chains require practice until the step of looking for connecting terms becomes automatic.

Verbloom's conditional reasoning practice builds from individual conditionals through multi-step chains, with explanations that diagram each step so you can see exactly where the chain connects and where it does not.

Build this skill at verbloom.dev.