2.2 Logical Deduction & Quantifier Logic

2.2 Logical Deduction & Quantifier Logic

Quick Answer: Logical deduction on the DAA evaluates your capacity to draw strictly necessary conclusions from given premises. Formal logic is a closed system: a conclusion is valid only if it is impossible for the premises to be true while the conclusion is false. You must ignore real-world plausibility and master formal quantifiers (All, None, Some, Most) and conditional mechanics (If-Then, Contrapositive).

In military command and control environments, logical coherence is vital. Tactical decisions, automated system rules, and rules of engagement depend on crisp deductive clarity. The DAA Logical Deduction sub-test measures your ability to analyze premises, spot logical fallacies, and determine what must strictly follow versus what is merely possible.

---

Deductive Validity vs. Real-World Truth

The defining rule of formal logic is: Validity is entirely structural. An argument is valid if its conclusions follow necessarily from its premises, regardless of whether those premises match real-world facts.

[Premise 1: All tanks are equipped with sonar] + [Premise 2: Vehicle X is a tank] 
                                  ⇓
       [Valid Conclusion: Vehicle X is equipped with sonar]

Even though real-world tanks do not use sonar, the conclusion is 100% logically valid within the closed premises provided. Conversely, an argument can contain factually true statements yet remain logically invalid if the structure does not guarantee the outcome.

---

Quantifier Logic: Mathematical Definitions

In everyday conversation, people use words like some or most loosely. In formal logic, quantifiers have rigid, non-negotiable definitions.

The "SOME" Trap in Formal Logic

In casual speech, saying "Some recruits passed the test" implies that some recruits failed. In formal logic, "SOME" means "at least one, and potentially all."

• If All soldiers are trained, it is logically true that Some soldiers are trained.
• Given the premise "Some officers are engineers," you cannot deduce that "Some officers are NOT engineers." The premise leaves open the possibility that all officers are engineers.

---

Conditional Reasoning (If-Then Framework)

A conditional statement asserts that if one condition (the antecedent) occurs, another condition (the consequent) is guaranteed to occur.

$\text{Structure: If } A \text{ (Sufficient Condition), then } B \text{ (Necessary Condition)} \quad (A \rightarrow B)$

The Four Conditional Forms

Given the rule: "If an aircraft signals Code Red ($A$), then it must land immediately ($B$)."

                       ┌── 1. Modus Ponens (VALID) ───────► A occurs  ⇒  B must occur
                       ├── 2. Contrapositive (VALID) ────► Not B   ⇒  Not A
Conditional Statements ┼── 3. Converse Fallacy (INVALID) ─► B occurs  ⇒  A must occur? (NO)
                       └── 4. Inverse Fallacy (INVALID) ──► Not A   ⇒  Not B? (NO)

1. Modus Ponens (Affirming the Antecedent) — VALID

• Fact: Aircraft 1 signals Code Red ($A$).
• Deduction: Aircraft 1 must land immediately ($B$).
• Reasoning: Meeting the sufficient condition guarantees the necessary condition.

2. The Contrapositive (Negating the Consequent) — VALID

• Fact: Aircraft 2 does NOT land immediately ($\neg B$).
• Deduction: Aircraft 2 did NOT signal Code Red ($\neg A$).
• Reasoning: If signaling Code Red mandates immediate landing, an aircraft that is not landing could not possibly have signaled Code Red. The contrapositive ($\neg B \rightarrow \neg A$) is always logically equivalent to the original statement ($A \rightarrow B$).

3. Fallacy of the Converse (Affirming the Consequent) — INVALID

• Fact: Aircraft 3 lands immediately ($B$).
• Fallacious Deduction: Aircraft 3 signaled Code Red ($A$).
• Why it fails: Landing immediately ($B$) is required during Code Red, but an aircraft might also land immediately due to low fuel, mechanical failure, or scheduled arrival. $B$ does not prove $A$.

4. Fallacy of the Inverse (Denying the Antecedent) — INVALID

• Fact: Aircraft 4 does NOT signal Code Red ($\neg A$).
• Fallacious Deduction: Aircraft 4 does NOT land immediately ($\neg B$).
• Why it fails: Failing to signal Code Red eliminates one reason for landing, but does not prevent the aircraft from landing for other reasons.

---

Syllogisms and Categorical Logic

A syllogism combines two or more premises to form a necessary conclusion. Understanding valid syllogistic structures prevents common logical missteps.

Valid Syllogistic Chains

1. Universal Chain:

   • Premise 1: All frigates ($A$) are surface vessels ($B$).
   • Premise 2: All surface vessels ($B$) are subject to maritime law ($C$).
   • Valid Conclusion: All frigates ($A$) are subject to maritime law ($C$). ($A \rightarrow B \rightarrow C \Rightarrow A \rightarrow C$).

2. Particular-Universal Combination:

   • Premise 1: Some specialists ($A$) are cyber operators ($B$).
   • Premise 2: All cyber operators ($B$) hold top-secret clearance ($C$).
   • Valid Conclusion: Some specialists ($A$) hold top-secret clearance ($C$).

3. Universal Negative Chain:

   • Premise 1: All radar technicians ($A$) are technical specialists ($B$).
   • Premise 2: No technical specialists ($B$) are uncertified ($C$).
   • Valid Conclusion: No radar technicians ($A$) are uncertified ($C$).

Invalid Syllogistic Traps

1. Two "Some" Premises Yield No Valid Conclusion:

   • Premise 1: Some sailors are divers.
   • Premise 2: Some divers are medics.
   • Invalid Deduction: Some sailors are medics. (The two "some" overlaps might involve completely separate subsets of divers).

2. Mid-Term Undistributed Fallacy:

   • Premise 1: All pilots wear helmets.
   • Premise 2: All motorcyclists wear helmets.
   • Invalid Deduction: All pilots are motorcyclists (or some pilots are motorcyclists). Both groups independently sit inside the larger "helmet wearers" set without guaranteed overlap between each other.

---

Visualizing Sets with Scratchpad Diagrams

When faced with complex categorical premises on the DAA, draw quick Euler or Venn diagrams on your scratch paper:

[ ALL A ARE B ]        [ SOME A ARE B ]        [ NO A ARE B ]
   ┌─────────┐            ┌───┐   ┌───┐           ┌───┐   ┌───┐
   │ B ┌───┐ │            │ A │ X │ B │           │ A │   │ B │
   │   │ A │ │            └───┴───┴───┘           └───┴───┴───┘
   │   └───┘ │           (Overlap = X)           (Disjoint Sets)
   └─────────┘

1. All A are B: Circle A is drawn entirely inside Circle B.
2. Some A are B: Circle A overlaps Circle B, creating an intersection area marked with an $X$.
3. No A are B: Circle A and Circle B are completely separate with no touching points.
4. Most A are B: Circle A overlaps Circle B such that more than half of Circle A's area is inside Circle B.