About Logic-2: Deductive-Reasoning

Quick Answer: Deductive reasoning is the process of drawing a necessarily true conclusion from premises that are known to be true. In sudoku, every technique from Naked Single to AIC is a deductive chain: given true facts on the board, the conclusion is forced with 100% certainty. If the premises are correct, the conclusion cannot be wrong. This is the logical backbone that separates solving from guessing.

1. Reconstruct the Dinner Bill

Reasoning doesn't have to happen on a puzzle board. Consider this everyday scene:

️ The Classic Form of Deductive Reasoning — the Syllogism

Premise 1: If Alice ate spicy food, she always orders ice water.
Premise 2: Alice did not order ice water.
Conclusion: Alice did not eat spicy food.

This conclusion is not "probably true," not "usually true" — it is 100% certain. If the premises are true, the conclusion cannot be false.

Deductive reasoning is humanity's most powerful reasoning tool. Its definition is short:

 Formal Definition: Deductive reasoning is a logical process that starts from a set of general premises known to be true, applies valid inference rules, and derives a necessary conclusion for a specific case.

Core Property: If the premises are true and the reasoning is valid, the conclusion cannot be false.
Difference from Inductive Reasoning: Induction goes from "many cases" to "probably" (all swans observed are white → the next swan is probably white). Deduction goes from "known truths" to "certainty" (all swans are white → this is a swan → it must be white). Deduction preserves truth; induction preserves probability.

2. Deductive Reasoning in Sudoku: The Complete Derivation of Pointing Pairs

Now let's bring this framework to the sudoku board. Here is the complete deductive process behind the intermediate technique of Pointing Pairs:

  ┌──────────┐   ├──────────┐   ├──────────┐
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  ├──────────┐   ├──────────┐   ├──────────┐
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  ├──────────┐   ├──────────┐   ├──────────┐
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  │ .  .  .   │ .  .  .   │ .  .  .   │
  └──────────┘   └──────────┘   └──────────┘

In Box 1, candidate 5 can only appear in row 1 (inside the box). Its box-external positions all lie along the Row 1 extension.

Now let's break Pointing Pairs down into standard deductive-reasoning form:

 Goal: Determine whether candidate 5 can be eliminated from columns 4-9 of row 1

Premise 1 (Known Fact): In Box 1, candidate 5 can only appear in the three empty cells belonging to row 1 (all other cells are eliminated by row/column/box constraints).

Premise 2 (Game Rule): Box 1 must contain exactly one 5.

Premise 3 (Spatial Constraint): All three candidate positions in Box 1 for the digit 5 belong to the same row — Row 1.

Deductive Chain:
① The 5 of Box 1 must be placed somewhere in Row 1 (inside the box) → (derived from Premises 1 + 2)
② Row 1 now already contains the 5 (positioned inside Box 1) → (derived from ①)
③ Row 1 cannot contain two 5s → (game rule)
④ Therefore: All other positions in Row 1 (columns 4-9) cannot be 5.

Conclusion: Eliminate candidate 5 from all cells in Row 1, columns 4-9. This conclusion is 100% certain.

Every step depends on the certainty of the previous step. This is the hallmark of deductive reasoning: if any single link in the chain breaks, the entire conclusion collapses.

3. Deductive Reasoning in Crosswords: Locking In Answers via Crossing Letters

In crosswords, crossing letters act as the "conductors" of the deductive chain. Here's a real example:

✏️ Deductive Chain in a Bible Crossword

The following is a real reasoning process extracted from our Bible Crossword Puzzle:

Premise 1: "The garden where Adam and Eve lived" = 4 letters.
Premise 2: The 2nd letter of 3-Down is D.
Premise 3: The 2nd letter of the Across word = the 2nd letter of 3-Down = D.
→ Candidate pool narrows to _ D _ _.

Premise 4: The 3rd letter of 7-Down is E.
Premise 5: The 4th letter of the Across word = the 3rd letter of 7-Down = E.
→ Candidate pool narrows to _ D _ E.

Candidate list (4-letter biblical place names): EDEN, ADAM, EVEN, ADEN…
Premise 6: None of the other candidates are a biblical "garden."
Conclusion: The answer must be EDEN.

At each step, without the crossing letter as a "conductor," you'd be blindly guessing from a candidate list. With it, each step transmits certainty from the known to the unknown — the deductive chain is welded together by cross-constraints.

4. Deductive Reasoning vs. Intuitive Leaps: Why X-Wing Requires 4-Step Verification

X-Wing is a cornerstone intermediate technique. Many tutorials simply say "spot this rectangle and eliminate those candidates." But without understanding its deductive chain, you're just memorizing a recipe.

  Distribution of candidate 3:
  C1 C2 C3 C4 C5 C6 C7 C8 C9
R1 .  .  .  .  .  .  .  .  .
R2 .  3  .  .  .  .  .  3  .   ← only c2 and c8 in this row can hold 3
R3 .  .  .  .  .  .  .  .  .
R4 .  .  .  .  .  .  .  .  .
R5 .  .  .  .  .  .  .  .  .
R6 .  3  .  .  .  .  .  3  .   ← only c2 and c8 in this row can hold 3
R7 .  .  .  .  .  .  .  .  .
R8 .  .  .  .  .  .  .  .  .
R9 .  .  .  .  .  .  .  .  .

Candidate 3 in r2 can only go in c2 or c8; in r6, also only in c2 or c8.
This forms a perfect rectangle.

 The Complete Deductive Chain of X-Wing (4 verification steps — none can be skipped):

Step 1 — Confirm the strong link: The 3 in r2 is either in (r2,c2) or (r2,c8). This is a binary necessity relationship.
Step 2 — Confirm the parallel strong link: The 3 in r6 is either in (r6,c2) or (r6,c8). Equally certain.
Step 3 — Establish diagonal mutual exclusion: If (r2,c2)=3 then (r6,c2)≠3 → so (r6,c8) must be 3. If (r2,c2)≠3 then (r2,c8) must be 3 → (r6,c8)≠3 → so (r6,c2) must be 3.
Step 4 — Cross-elimination: In either case, the 3 in c2 must be in either r2 or r6 (and nowhere else in that column). → From all other rows in c2 (r1,r3,r4,r5,r7,r8,r9), candidate 3 can be eliminated. Similarly, from all other rows in c8, candidate 3 can be eliminated.

The most elegant part of this deductive chain: You don't need to know which specific corner holds the 3. You only need to know that the four corners share a necessary logical relationship, and that relationship alone yields an actionable conclusion. In formal logic, this is called a "Constructive Dilemma": whether A or B holds, C follows in either case.

5. Daily Training Methods for Deductive Reasoning

Don't just use it when solving puzzles. You can deliberately train deductive thinking in everyday life:

Training Method	Corresponding Sudoku/Crossword Skill
After reading a news article, list the premises the conclusion depends on, and check whether each premise truly holds	Verifying whether each elimination exhausted all candidates
Rewrite your opinion in "if...then..." format	Building Forcing Chains / AIC chains
Deliberately overturn a premise and check whether the conclusion collapses (counterfactual reasoning)	Testing whether a cell is truly a Naked Single (verifying each eliminated digit one by one)
Compress a long argument into syllogism form	Compressing Skyscraper pattern recognition into "weak-strong-weak" chain logic

 Key Takeaways

• Deductive reasoning = Law of Excluded Middle + Transitivity. Excluded Middle gives you the first elimination; transitivity carries it down the chain.
• Every advanced sudoku technique is a special case of a deductive chain. X-Wing, Skyscraper, XY-Wing — they're not teaching you intuition; they're teaching you how to construct deductive chains.
• In crosswords, crossing letters = strong/weak links in sudoku. Both serve as "conductors" that transmit certainty from the known to the unknown.
• Deductive reasoning doesn't care about "how likely" something is — it only cares about "necessity." If a conclusion is merely "highly probable," that's inductive inference, not deduction. Next, we'll explore inductive reasoning.

❓ Frequently Asked Questions

Q: How do deductive and inductive reasoning work together in actual solving?

Induction helps you "spot the pattern" — X-Wing positions follow a recognizable pattern, and your brain, through solving many puzzles, inductively learns "when you see a rectangle, be alert." Deduction helps you "verify the pattern" — confirming that this rectangle satisfies X-Wing's strict premises (two parallel binary strong links). Experience tells you where to look; logic tells you whether you can eliminate.

Q: Which relies more on deductive reasoning — crosswords or sudoku?

Sudoku is 100% deductive — the entire game is mechanical execution of deductive reasoning. Crosswords require mixed reasoning: definition → vocabulary (inductive: based on corpus probabilities) + cross-verification (deductive: letters must match). Crosswords involve a higher proportion of "educated guessing" than sudoku, but the more crossing points there are, the larger the deductive share becomes.

Q: Can deductive reasoning go wrong?

Deductive reasoning itself cannot be wrong — if premises are true and the reasoning is valid, the conclusion is necessarily true. But human execution of deductive reasoning can fail at two points: (1) a premise is not actually true (mistaking "possible" for "certain"); (2) a step was skipped in the chain (missed checking one constraint zone). A sudoku "mistake" is never deduction's fault — it's because you overlooked one digit.

Q: Why is Pointing Pairs called "deduction" but simple elimination isn't?

Simple elimination IS deduction! "Two 5s in the same row → this cell cannot be 5" = the most basic deductive inference. The only difference is chain length: simple elimination = 1 step; Pointing Pairs = 3 steps; X-Wing = 4 steps; AIC = variable length. The logical essence is identical; only the chain length differs.

 Further Reading

• Previous: The Law of Excluded Middle — Why Sudoku Never Needs Guessing (the logical foundation of deductive reasoning)
• Next: Inductive Reasoning: Finding Patterns — the pattern-recognition logic behind X-Wing and Swordfish
• Sudoku Tutorial Companion: Step 11 — Pointing Pairs and Box-Line Reduction
• Crossword Companion: One-Minute Mystery Crossword #2 — experience cross-constraint deductive chains interactively

Tags: logical reasoning, logic puzzle, critical thinking, deductive reasoning, Sudoku game, problem solving

易 Logic & Reasoning Series

✅ #1: The Law of Excluded Middle — Why Sudoku Never Needs Guessing ✅ #2: Deductive Reasoning — From Known Truths to Certainty  #3: Inductive Reasoning — Coming soon

About Logic-1: Law-of-Excluded Middle

Quick Answer: The Law of Excluded Middle states that for any proposition, either it is true or its negation is true — there is no third option. In sudoku, this law is the logical engine behind every technique: when you eliminate all impossibilities for a cell, the one remaining candidate must be correct. There is no "maybe." There is no guessing. There is only logical certainty.

1. A Scene from Everyday Life

Imagine you are looking for your car in a parking lot. You remember it's in Section B. Section B has 9 rows. You check each row:

— Row 1? No.
— Row 2? No.
— Row 3? No.
…
— First 8 rows? All eliminated.
→ It must be in Row 9.

You didn't "guess" the car is in Row 9. You used one of the oldest logical laws known to humanity: the Law of Excluded Middle.

📖 Formal Definition: For any proposition P, either P is true or its negation is true. There is no third option.
Latin: tertium non datur — "there is no third possibility"
Symbolic Notation: P ∨ ¬P (P or not-P — one must hold)

2. The Law of Excluded Middle in Sudoku: The Logical Core of Naked Single

Consider a specific sudoku cell:

    5   3   ?  |  7   .   .  |  .   .   .
    .   .   .  |  1   9   5  |  .   .   .
    .   .   .  |  .   .   .  |  .   .   .
    -----------+-------------+-----------
    .   .   .  |  .   .   .  |  .   .   .
    .   .   .  |  .   .   .  |  .   .   .
    .   .   .  |  .   .   .  |  .   .   .
    -----------+-------------+-----------

In the top-left box (Box 1), what can go in cell r1c3?

Let's examine the triple-constraint environment of cell r1c3:

Constraint Zone	Existing Digits	Eliminated Digits
Row 1	5, 3, 7	5, 3, 7
Column 3	(no given digits here)	—
Box 1	5, 3, 1, 9, 5	1, 5, 3, 9
Combined Elimination	Eliminated so far: 1, 3, 5, 7, 9

This leaves four candidates: 2, 4, 6, 8. Can't decide yet? Let's add the column constraints:

Candidate	Already present in column 3?	Verdict
2	No	Possible ✓
4	No	Possible ✓
6	No	Possible ✓
8	No	Possible ✓

In this example, four candidates remain — the Law of Excluded Middle can't deliver the final answer yet. But this illustrates exactly how the law operates: it is not a one-step oracle, but a step-by-step engine that shrinks the possibility space. Every "it's not X" judgment prepares the ground for the final "it must be Y."

🔍 Simplified Version — When Only One Candidate Remains

Suppose after multiple rounds of elimination, the candidates for r1c3 are reduced to just {2}.

Q: Is r1c3 a 2?
A: Either it is 2, or it is not 2.
Q: Could it be any other digit?
A: 1→eliminated by the same row. 3→eliminated by the same box. 4→eliminated by the same column… 8→eliminated by the same column.
→ All 8 other digits are impossible.
→ Therefore, r1c3 must be 2.

This is the Naked Single technique, and its logical core is the Law of Excluded Middle.

3. The Law of Excluded Middle in Crosswords: The Power of Cross-Constraints

The Law of Excluded Middle doesn't only apply to numeric logic. Here's a crossword scenario:

✏️ Crossword Example

3-Across: "A four-letter word meaning 'feline'"
You already have C _ T _

Candidates: CATA? CATS? COTE? CITY?

4-Down: "The opposite of false" (5 letters)
You already have T _ U _ _

Now, the 2nd letter of 4-Down must match the 3rd letter of 3-Across.

If 3-Across is CATS → crossing cell = T → 4-Down = T _ U T _ → "TRUTH" fits perfectly!

The Law of Excluded Middle at work: The crossing letter between CATS and TRUTH either matches or it doesn't. There is no "partial match." Once CATS→T aligns with TRUTH's T, all other candidates (CATA, etc.) are eliminated at the crossing cell. CATS becomes a necessity.

Crossword intersections are the analog of sudoku's "row-column-box intersections." Both games share the same logical pattern: cross-constraint → eliminate the impossible → what remains must be the answer.

4. Cognitive Traps: Why We Still "Guess" Despite the Law of Excluded Middle

If the Law of Excluded Middle is so fundamental, why do beginners still "guess"? Three cognitive reasons:

❌ Trap 1: Concluding Before Checking All Constraints

The brain loves shortcuts. Seeing 5 digits eliminated, it assumes only one remains — when in fact three more constraint zones have yet to be checked.

→ The Law of Excluded Middle only works when you've exhausted ALL possibilities, not when you've "checked a few and called it done."

❌ Trap 2: Treating Binary Choices as "50/50"

When only two candidates remain, intuition says "either one works, just pick one." But the Law of Excluded Middle is not gambling — only one of the two can survive the cross-verification of all constraints.

→ "Pick one of two" doesn't mean "pick randomly" — it means "find evidence to eliminate one of them."

❌ Trap 3: Confusing "Haven't Figured It Out Yet" with "Can't Figure It Out"

When you're stuck, your brain says "this path is blocked, switch paths." That doesn't mean you need to guess — it just means you need to re-scan from a different constraint zone.

→ Sudoku never requires guessing. You just need more rounds of elimination.

5. Applications of the Law of Excluded Middle Beyond Puzzles

Domain	How the Law of Excluded Middle Applies
🧩 Sudoku	Naked Single: eliminate 8 digits → the last one is certain
✏️ Crosswords	Crossing-letter verification: letters either match or they don't
💻 Debugging	Binary elimination: is the bug in module A or module B?
🏥 Medical Diagnosis	Differential diagnosis: normal temperature → rules out infection type A; rash present → rules out infection type B → what's left is the answer
🏛️ Legal Reasoning	"Beyond reasonable doubt": eliminate all reasonable doubts, and the defendant's guilt follows with necessity
🔬 Scientific Method	Hypothesis testing: if experiment contradicts hypothesis, either the hypothesis is wrong or the experimental design is flawed (both cannot be true simultaneously)

🔑 Key Takeaways

• The Law of Excluded Middle is why sudoku never lies: every cell has one definite digit; every digit has one definite arrangement.
• Naked Single is just one application of the Law of Excluded Middle: eliminate the impossible → what remains must be the truth.
• Next Step: From "one cell has only one candidate" (Naked Single) to "one digit has only one possible cell in a house" (Hidden Single) — this is the leap in reasoning perspective from "cell-centric" to "digit-centric."
• Remember: 100% logical clarity yields 100% certainty. The Law of Excluded Middle means guessing is never necessary.

❓ Frequently Asked Questions

Q: What is the difference between the Law of Excluded Middle and the Law of Non-Contradiction?

Law of Non-Contradiction: a proposition cannot be both true and false at the same time (¬(P ∧ ¬P)). Law of Excluded Middle: a proposition is always either true or false (P ∨ ¬P). Non-contradiction says "you can't have both"; Excluded Middle says "you must have one."

Q: Which relies more on the Law of Excluded Middle — Naked Single or Hidden Single?

Both equally. Naked Single eliminates all other candidates from a cell; Hidden Single eliminates all other positions for a digit in a house. The difference is only in what is being eliminated — a cell or a digit. The underlying logical pattern of "eliminate, then take what's left" is identical.

Q: Does the Law of Excluded Middle have exceptions?

In classical logic, the Law of Excluded Middle is an axiom with no exceptions. However, some schools (such as constructivist logic) reject it — they argue you cannot assert "either P or not-P" unless you have actually proved one of them. But in the sudoku world, classical Excluded Middle applies perfectly: a cell is either 1 or 2 or ... or 9 — it must fall into one of those.

Q: Why doesn't a crossword puzzle need the Law of Excluded Middle?

On the contrary — crosswords absolutely need it! When you fill in a word, the reasoning that "only this one word in English satisfies both the definition and the crossing letters" is itself an application of the Law of Excluded Middle — all non-matching words are eliminated, and the remaining one is the unique answer. You've simply replaced "candidate list" with "vocabulary."

📚 Further Reading

• Next: Deductive Reasoning: From Known Truths to Certainty — how X-Wing uses "if...then..." chains to eliminate candidates across 4 cells
• Sudoku Tutorial Companion: Step 4 — The Single Candidate Rule (full tutorial on Naked Single)
• Crossword Companion: One-Minute Mystery Crossword #1 — experience the power of cross-constraints interactively

Tags: logical reasoning, logic puzzle, critical thinking, Sudoku game, problem solving ,Sudoku game solving

易 Logic & Reasoning Series

✅ #1: The Law of Excluded Middle — Why Sudoku Never Needs Guessing ✅ #2: Deductive Reasoning — From Known Truths to Certainty  #3: Inductive Reasoning — Coming soon