The Smallest Trick in LSAT Conditional Logic: Negation Flips the Connector
Most students who miss a conditional logic question don’t miss it because the logic is hard. They miss it because of one tiny step they did too fast: negating a statement that has an “and” or an “or” inside it.
I see this constantly. A student diagrams the conditional correctly, writes the contrapositive confidently, and then gets the right-hand side wrong. The error costs points on conditional inference, assumption, and parallel reasoning questions, and it is entirely mechanical. That means it is entirely fixable.
Here is the whole rule. When you negate a compound statement, the connector flips. “And” becomes “or.” “Or” becomes “and.” Then you negate each piece. That’s it.
Why does it work? Think about what it takes to break each kind of requirement. If a statement requires both A and B, you break it by losing either one. One failure is enough, so the negation is “not A or not B.” If a statement requires at least one of A or B, the only way to break it is to lose both. So the negation is “not A and not B.”
Let’s run it on a real-feeling example. Say the stimulus tells you: if a candidate is hired, she passed the interview and the background check.
Hired → passed interview AND passed background check.
To build the contrapositive, you negate the right side and flip the arrow. The right side is an “and,” so its negation is an “or”: failed the interview OR failed the background check. The contrapositive reads: if she failed either one, she was not hired.
Notice how natural that sounds in plain English. You don’t need her to fail both. One failure sinks her. The mistake students make here is writing “failed the interview AND failed the background check,” which is far too strong. It would only trigger the conditional when she failed both, and you’d miss the answer choice that says “she failed the background check, so she wasn’t hired.”
Now flip the situation. If the bill passes, it received support from the mayor or the council.
Get LSAT Guy’s stories in your inbox
Join Medium for free to get updates from this writer.
Passes → mayor supports OR council supports.
Negating an “or” gives you an “and.” The contrapositive is: if the bill got no support from the mayor and no support from the council, it did not pass. Both have to be missing before you can conclude anything. If you only know the mayor withheld support, the contrapositive tells you nothing, because the council might have carried it.
That last point matters because LSAT writers love to build wrong answers around exactly this gap. An answer choice will hand you one negated piece and invite you to conclude the whole thing fails. When the connector is an “or,” one missing piece is not enough.
A quick note on “or” itself. On the LSAT, “or” is inclusive unless the stimulus says otherwise. “A or B” means A, B, or both. That’s precisely why its negation requires both to be false. Occasionally you’ll see “either A or B, but not both,” which is exclusive and needs more care, but treat inclusive as your default.
Three mistakes to watch for in your own work:
Forgetting to swap the connector. This is the big one. If you negate “A and B” as “not A and not B,” stop and redo it.
Negating only one term. “Not A and B” is incomplete. The negation applies to the entire compound, so every piece gets negated.
Assuming “or” is exclusive. Read for “but not both.” If it isn’t there, it’s inclusive.
This skill also shows up inside the negation test for necessary assumption questions. If the assumption you’re testing contains an “and” or an “or,” you have to negate it correctly before you can tell whether it destroys the argument. A botched negation there can make you reject a right answer or keep a wrong one.
A short phrase to drill: negation flips the connector. Say it while you practice. Write ten compound conditionals, build each contrapositive, and check that every “and” turned into an “or” and vice versa. Ten minutes of that does more than rereading any explanation.
I originally published the complete version of this framework on Verbloom: https://verbloom.dev/blog/and-or-negation-lsat
