11.3 Binary Logic: Truth-Tellers, Liars, Alternators & Matrix Logic Deductions

The Three Canonical Archetypes of Binary Logic

Use exactly the speaker types stipulated in the puzzle. The following three types are common exercise conventions, not a requirement that every binary-logic question contain all three:

+-----------------------------------------------------------------------------+
|                        THE THREE BINARY LOGIC PERSONAS                      |
+-----------------------------------------------------------------------------+
| 1. TRUTH-TELLER (Knight):   Speaks ONLY the truth.                          |
|                             Truth Value Sequence: [ T, T, T, T, ... ]       |
|                                                                             |
| 2. LIAR (Knave):            Speaks ONLY falsehoods.                         |
|                             Truth Value Sequence: [ F, F, F, F, ... ]       |
|                                                                             |
| 3. ALTERNATOR (Spy):        Strictly alternates between Truth and Lie       |
|                             in either sequence:                             |
|                             Case A: [ True, False, True, False, ... ]       |
|                             Case B: [ False, True, False, True, ... ]       |
+-----------------------------------------------------------------------------+

Self-Referential Statements & The Impossibility Theorems

Certain statements yield immediate deductions regardless of external facts due to internal logical constraints:

1. The 'I am a Liar' Paradox:
   • Can a Truth-Teller say "I am a Liar"? No. A Truth-Teller cannot utter a false statement.
   • Can a Liar say "I am a Liar"? No. If a Liar says "I am a Liar", they would be speaking the truth about their identity, which violates the Liar's definition.
   • The Inescapable Deductive Conclusion: In a universe containing Truth-Tellers, Liars, and Alternators, if a person states "I am a Liar", that person MUST be an Alternator making a False statement ($F$)!
2. The 'I am not a Truth-Teller' Claim:
   • A Truth-Teller cannot say it (it would be a lie).
   • A Liar CAN say it? If a Liar says "I am not a Truth-Teller", that statement is true! But a Liar cannot speak the truth.
   • Therefore, this statement can only be made by an Alternator speaking a truth ($T$), since an Alternator is not a Truth-Teller.
3. The 'I am an Alternator' Claim:
   • A Truth-Teller cannot say it (it is false).
   • A Liar CAN say it (it is a lie, since the speaker is actually a Liar).
   • An Alternator CAN say it, provided it is their True turn ($T$).

+-----------------------------------------------------------------------------+
|                     SELF-REFERENTIAL STATEMENT TRUTH MATRIX                 |
+-----------------------------------------------------------------------------+
| Statement Uttered          | Truth-Teller | Liar         | Alternator       |
|----------------------------|--------------|--------------|------------------|
| 'I am a Truth-Teller'      | CAN SAY (T)  | CAN SAY (F)  | CAN SAY (only F) |
| 'I am a Liar'              | IMPOSSIBLE   | IMPOSSIBLE   | CAN SAY (only F) |
| 'I am an Alternator'       | IMPOSSIBLE   | CAN SAY (F)  | CAN SAY (only T) |
+-----------------------------------------------------------------------------+

---

Analytical Solution Methodologies

Solving complex binary logic problems without circular guessing requires two disciplined analytical tools:

Method 1: The Contradiction Identification Method

Look for pairs of statements that are diametrically opposed or logically mutually exclusive:

• If Person A asserts: "The signal at KM 42 was Green."
• And Person B asserts: "The signal at KM 42 was Red."
• Deduction: Both statements cannot be simultaneously true. At least one person is lying. If the problem restricts all speakers to Truth-Tellers or Liars and specifies exactly one Liar, that Liar must be either A or B. Consequently, all other individuals (C, D, E...) are immediately proven to be Truth-Tellers!

Method 2: Case Assumption (Hypothesis-Testing Tree)

The two-branch illustration below applies when the anchor is known to be a Truth-Teller or Liar. If an Alternator is allowed, test that third persona and its permitted truth order as well. A branch with no contradiction is a candidate, not proof of uniqueness: retain every surviving branch and check all clues. When no direct contradiction is obvious, systematically test persona hypotheses on an anchor speaker:

                         +---------------------------------+
                         |   Select Anchor Speaker (e.g. A)| 
                         +---------------------------------+
                                          │
                     ┌────────────────────┴────────────────────┐
                     ▼                                         ▼
       +----------------------------+            +----------------------------+
       | HYPOTHESIS 1: Assume A = T |            | HYPOTHESIS 2: Assume A = F | 
       +----------------------------+            +----------------------------+
                     │                                         │
                     ▼                                         ▼
       Trace all deductions onto                 Trace all deductions onto
       Speakers B, C, D...                       Speakers B, C, D...
                     │                                         │
        Does an internal conflict                 Does an internal conflict
        or rule violation emerge?                 or rule violation emerge?
            /                \                        /                \
          YES                 NO                    YES                 NO
           │                  │                      │                  │
           ▼                  ▼                      ▼                  ▼
      REJECT HYP. 1     RETAIN HYP. 1           REJECT HYP. 2     RETAIN HYP. 2
      (A cannot be T)   (Check other cases)       (A cannot be F)   (Check other cases)

---

Matrix Logic Deductions: The Cross-Grid Elimination Protocol

Matrix logic puzzles require mapping relationships between multiple distinct categorical dimensions (e.g., 5 Section Controllers $\times$ 5 Railway Divisions $\times$ 5 Train Types $\times$ 5 Roster Shift Days). Attempting mental tracking leads to cognitive overload; constructing a formal two-dimensional Cross-Grid Matrix makes exclusions and remaining possibilities explicit.

+-----------------------------------------------------------------------------+
|                      THE CROSS-GRID LOGIC MATRIX ARCHITECTURE               |
+-----------------------------------------------------------------------------+
|                  |      RAILWAY DIVISIONS      |      TRAIN CLASSES         |
| CONTROLLERS      | Mumbai | Delhi | Howrah| Chen| Rajdhani| Freight| Mail |Vande|
|------------------|--------|-------|-------|-----|---------|--------|------|-----|
| Arun             |   ✓    |   x   |   x   |  x  |    x    |   ✓    |  x   |  x  |
| Bikram           |   x    |       |       |     |         |   x    |      |     |
| Chitra           |   x    |       |       |     |         |   x    |      |     |
| Deepak           |   x    |       |       |     |         |   x    |      |     |
+------------------+--------+-------+-------+-----+---------+--------+------+-----+
| DIVISIONS        |                                                          |
| Mumbai           |                              |    x    |   ✓    |  x   |  x  |
| Delhi            |                              |         |   x    |      |     |
+-----------------------------------------------------------------------------+

Clue Classification & Systematic Execution Protocol

Every clue in a competitive puzzle falls into one of four operational categories:

1. Definite Clues (Direct Confirmations):
   • Example: "Arun is in charge of the Mumbai Division."
   • Action: Place a Confirm (✓) at the intersection of Arun and Mumbai. Immediately fill all remaining cells in Arun's division row and Mumbai's controller column with Crosses (x).
2. Negative Clues (Direct Eliminations):
   • Example: "Bikram does not manage Freight rakes and is not posted in Northern Railway."
   • Action: Place an x at (Bikram, Freight) and (Bikram, Northern).
3. Conditional Linkages (Implication Chains):
   • Example: "The controller managing Freight trains is posted in Mumbai Division."
   • Action: Link Freight = Mumbai. Since Arun is already assigned to Mumbai, Arun must manage Freight! Place a ✓ at (Arun, Freight) and (Mumbai, Freight).
4. Relative / Positional Clues:
   • Example: "The controller handling Shatabdi Express works on a shift two days before the controller on Central Railway."
   • Action: Model numerical offsets: $\text{Day}(\text{Shatabdi}) = \text{Day}(\text{Central}) - 2$. This immediately eliminates extreme boundary days (for a Monday-to-Friday roster, Shatabdi cannot be Thursday or Friday and Central cannot be Monday or Tuesday).

---

Worked Examples

Worked Example 1: Three-Person Binary Logic Incident Inquiry

Operational Context: Following an unscheduled emergency braking incident, three controllers—Alok, Bhaskar, and Chetan—are questioned. Exactly one is a Truth-Teller, one is a Liar, and one is an Alternator. Each provides two statements:

• Alok:
  • Statement 1: "Bhaskar is the Liar."
  • Statement 2: "Chetan is the Truth-Teller."
• Bhaskar:
  • Statement 1: "Alok is not the Truth-Teller."
  • Statement 2: "Chetan is an Alternator."
• Chetan:
  • Statement 1: "I am the Alternator."
  • Statement 2: "Bhaskar is a Liar."

Analytical Deduction Trace:

• Step 1: Evaluate Chetan's Persona:
  • Can Chetan be the Truth-Teller? If Chetan were the Truth-Teller, Chetan-1 ("I am the Alternator") would have to be True. But a Truth-Teller cannot claim to be an Alternator! Contradiction.
  • Therefore, Chetan is NOT the Truth-Teller.
• Step 2: Evaluate Alok as Truth-Teller Candidate:
  • Assume Alok is the Truth-Teller ($T, T$):
    • Alok-1 is True $\implies$ Bhaskar is the Liar.
    • Alok-2 is True $\implies$ Chetan is the Truth-Teller.
    • Contradiction! This would result in two Truth-Tellers (Alok and Chetan), violating the rule that exactly one person is a Truth-Teller.
  • Therefore, Alok is NOT the Truth-Teller.
• Step 3: Conclude the Truth-Teller by Elimination:
  • Since neither Chetan nor Alok is the Truth-Teller, Bhaskar MUST be the Truth-Teller ($T, T$)!
• Step 4: Trace Downstream Truths from Bhaskar ($T, T$):
  • Bhaskar-1 is True: "Alok is not the Truth-Teller" $\implies$ True (Alok is indeed not TT).
  • Bhaskar-2 is True: "Chetan is an Alternator" $\implies$ True! Chetan is confirmed as the Alternator.
• Step 5: Identify Alok's Persona:
  • By elimination, Alok MUST be the Liar ($F, F$).
• Step 6: Verify All Remaining Statements:
  • Check Alok (Liar: $F, F$):
    • Alok-1 ("Bhaskar is the Liar") $\implies$ False (since Bhaskar is TT). Correct!
    • Alok-2 ("Chetan is the Truth-Teller") $\implies$ False (since Chetan is Alternator). Correct!
  • Check Chetan (Alternator):
    • Chetan-1 ("I am the Alternator") $\implies$ True (since Chetan is Alternator).
    • Chetan-2 ("Bhaskar is a Liar") $\implies$ False (since Bhaskar is TT).
    • Sequence of truth values for Chetan: $[T, F]$—a strictly valid alternation!
• Conclusion: Bhaskar is the Truth-Teller, Alok is the Liar, and Chetan is the Alternator.

---

Worked Example 2: Four Controllers with One Statement Each (2 Truth-Tellers, 2 Liars)

Operational Context: An axle counter fault was logged. Four controllers—P, Q, R, and S—make one statement each. Exactly two are Truth-Tellers and two are Liars:

• P: "Q is a Liar."
• Q: "R is a Liar."
• R: "S is a Liar."
• S: "P and Q are both Liars."

Analytical Deduction Trace:

• Step 1: Identify Contradiction / Dependency Pairs:
  • P says Q is a Liar. P and Q have opposite truth values: one is $T$ and one is $F$.
  • Q says R is a Liar. Q and R have opposite truth values: one is $T$ and one is $F$.
  • R says S is a Liar. R and S have opposite truth values: one is $T$ and one is $F$.
• Step 2: Trace Truth Values from Alternating Chains:
  • If P is True ($T$):
    • P $= T \implies$ Q $= F$ (since P speaks truth).
    • Q $= F \implies$ R $= T$ (since Q lies when calling R a liar).
    • R $= T \implies$ S $= F$ (since R speaks truth when calling S a liar).
  • Now evaluate S's statement under this assignment $(P=T, Q=F, R=T, S=F)$:
    • S claims: "P and Q are both Liars."
    • Is this statement True or False? Since P is $T$, they are not both liars. S's statement is False.
    • Since S $= F$, a False statement from S is 100% consistent!
  • Count of Truth-Tellers and Liars: $P$ and $R$ are $T$ (2 Truth-Tellers); $Q$ and $S$ are $F$ (2 Liars).
• Step 3: Test the Reverse Case (P is False):
  • If P $= F \implies$ Q $= T \implies$ R $= F \implies$ S $= T$.
  • If S $= T$, S's statement ("P and Q are both Liars") must be True.
  • But here Q is $T$, so P and Q are NOT both liars. S's statement is False, contradicting S being $T$!
  • Therefore, this assignment is impossible.
• Conclusion: P and R are the Truth-Tellers; Q and S are the Liars.

---

Worked Example 3: Multi-Variable Matrix Deduction (Operational Roster)

Problem: Four Section Controllers—Dave, Esha, Firoz, and Gita—manage four different sections: Northern, Western, Central, and Southern. They each supervise a distinct category of traffic: Freight, Rajdhani, Shatabdi, and Suburban. They work their primary weekly night shift on four different days: Monday, Tuesday, Wednesday, and Thursday.

Clues Provided:

1. The controller managing the Central section works on Wednesday.
2. Dave manages the Northern section, but does not supervise Freight or Suburban.
3. The Rajdhani controller works on Tuesday and is not posted in the Western section.
4. Esha manages the Shatabdi Express, but does not work on Central or Southern sections.
5. Firoz works on Monday.
6. The Central section controller supervises Freight.

Step-by-Step Analytical Trace:

• Step 1: Match Day, Section, and Train Class:
  • From Clue 1: Wednesday = Central.
  • From Clue 3: Tuesday = Rajdhani. Since Rajdhani is not Western, and Wednesday is Central, Western must be Monday or Thursday.
  • From Clue 5: Firoz = Monday.
  • From Clue 4: Esha manages Shatabdi. Since Shatabdi is not Rajdhani and Clue 6 assigns Freight to Central, Shatabdi is neither Tuesday nor Wednesday; it must be Monday or Thursday.
• Step 2: Determine Esha's Day and Section:
  • Esha cannot be Monday (since Firoz is Monday). Therefore, Esha works on Thursday!
  • Since Esha is on Thursday, Esha = Thursday = Shatabdi.
  • Now Firoz (Monday) must manage the remaining train type that is not Rajdhani (Tuesday), Central's train (Wednesday), or Shatabdi (Thursday).
• Step 3: Determine Dave's Day, Train, and Section:
  • From Clue 2: Dave = Northern. Dave does not supervise Freight or Suburban.
  • The four train types are: Rajdhani, Shatabdi, Freight, Suburban.
  • Since Dave cannot be Freight or Suburban, and Esha is Shatabdi, Dave MUST supervise Rajdhani!
  • From Clue 3: Rajdhani works on Tuesday. Therefore, Dave works on Tuesday!
  • Summary for Dave: Dave = Northern = Rajdhani = Tuesday.
• Step 4: Determine Wednesday's Controller:
  • The days assigned so far: Firoz = Monday, Dave = Tuesday, Esha = Thursday.
  • The only remaining controller for Wednesday is Gita!
  • From Clue 1: Wednesday is Central. Therefore, Gita = Central = Wednesday.
• Step 5: Determine Sections for Firoz and Esha:
  • Northern is Dave (Tuesday); Central is Gita (Wednesday).
  • The remaining sections are Western and Southern.
  • Clue 4 states Esha does not work on Southern. Therefore, Esha = Western!
  • By elimination, Firoz = Southern.
• Step 6: Determine Trains for Firoz and Gita:
  • Dave has Rajdhani, Esha has Shatabdi.
  • The remaining trains are Freight and Suburban.
  • Clue 2 states Dave does not manage Suburban or Freight (already satisfied).
  • If Southern has Freight, Firoz has Freight, Gita has Suburban (or vice-versa). Clue 6 explicitly states that Central handles Freight, so Gita = Freight and Firoz = Suburban. Without this clue, the two train assignments would remain interchangeable.
• Final Deduction Matrix: