4.3 Formal Syllogisms, Categorical Logic & Deductive Proofs

Formal Syllogisms, Categorical Logic & Deductive Proofs

Deductive logic on the ACET tests your ability to evaluate arguments based strictly on their structural validity, independent of real-world truth or empirical plausibility. Questions present premises and require you to identify necessary conclusions, detect logical fallacies, or establish statement equivalences. Mastering categorical syllogisms and conditional proposition calculus is essential for securing a high score in this section.

---

1. Truth vs. Validity: The Deductive Baseline

In formal logic, a clear distinction exists between Truth and Validity:

• Validity is a property of argument structure. An argument is valid if and only if it is logically impossible for its premises to be true while its conclusion is false.
• Truth is a property of individual statements regarding factual reality.
• Soundness: An argument is sound if and only if it is valid AND all of its premises are factually true.

ACET Rule: Never use external domain knowledge or real-world facts to evaluate a syllogism. If a premise states "All cats are reptiles," you must accept that statement as absolute truth within the scope of the problem.

---

2. Standard Categorical Propositions (The AEIO Framework)

Categorical logic analyzes relationships between classes of objects. Every categorical statement maps to one of four standard form propositions:

                 UNIVERSAL                      PARTICULAR
        +----------------------------+----------------------------+
        | Universal Affirmative (A)  | Particular Affirmative (I) |
AFFIRMATIVE | "All S are P"              | "Some S are P"             |
        | Formula: S ⊆ P             | Formula: S ∩ P ≠ ∅         |
        +----------------------------+----------------------------+
        | Universal Negative (E)     | Particular Negative (O)    |
NEGATIVE | "No S are P"               | "Some S are not P"         |
        | Formula: S ∩ P = ∅         | Formula: S \ P ≠ ∅         |
        +----------------------------+----------------------------+

Distribution of Terms

A term is distributed if the proposition makes a claim about every member of the class represented by that term.

---

3. Rules of Syllogistic Validity

A categorical syllogism consists of three propositions containing exactly three terms: the Major Term (predicate of conclusion), the Minor Term (subject of conclusion), and the Middle Term (appears in both premises, but NOT in conclusion).

To determine if a syllogism is valid, verify these five fundamental rules:

1. Rule of the Distributed Middle: The middle term must be distributed in at least one premise. Violation $\implies$ Fallacy of Undistributed Middle.
2. Rule of Retained Distribution: Any term distributed in the conclusion MUST be distributed in the premise where it occurs. Violation $\implies$ Illicit Major or Illicit Minor fallacy.
3. Rule of Negative Premises: Two negative premises ($E$ or $O$) yield NO valid conclusion. Violation $\implies$ Exclusive Premises Fallacy.
4. Rule of Negative Quality: If either premise is negative, the conclusion MUST be negative; if the conclusion is negative, one premise MUST be negative.
5. Existential Rule: Two universal premises ($A$ or $E$) cannot produce a particular conclusion ($I$ or $O$) in modern Boolean logic.

---

4. Conditional Propositional Calculus ($p \rightarrow q$)

A conditional statement asserts that if an antecedent ($p$) is true, then a consequent ($q$) must also be true: $p \rightarrow q$.

Truth Table for Implication

Statement Transpositions & Equivalences

For a given conditional proposition $p \rightarrow q$:

• Original Implication: $p \rightarrow q$
• Converse: $q \rightarrow p$ (INVALID equivalence — Fallacy of Affirming the Consequent)
• Inverse: $\neg p \rightarrow \neg q$ (INVALID equivalence — Fallacy of Denying the Antecedent)
• Contrapositive: $\neg q \rightarrow \neg p$ (VALID EQUIVALENCE! Always logically identical to $p \rightarrow q$)

                       EQUIVALENT
   Original: p --------> q  <===============> Contrapositive: ~q --------> ~p
               |       |                                        |       |
     INVALID   |       | INVALID                      INVALID   |       | INVALID
               v       v                                        v       v
   Converse: q --------> p  <===============> Inverse:        ~p --------> ~q
                       EQUIVALENT

Valid Argument Forms vs. Fallacies

1. Modus Ponens (Affirming Antecedent - VALID): $p \rightarrow q, \quad p \quad \vdash \quad q$
2. Modus Tollens (Denying Consequent - VALID): $p \rightarrow q, \quad \neg q \quad \vdash \quad \neg p$
3. Hypothetical Syllogism (Chain Rule - VALID): $p \rightarrow q, \quad q \rightarrow r \quad \vdash \quad p \rightarrow r$
4. Affirming the Consequent (FALLACY - INVALID): $p \rightarrow q, \quad q \quad \vdash \quad p \quad \text{(ERROR!)}$
5. Denying the Antecedent (FALLACY - INVALID): $p \rightarrow q, \quad \neg p \quad \vdash \quad \neg q \quad \text{(ERROR!)}$

---

5. Translating Natural Language into Formal Logic

ACET word problems disguise conditional operators using subtle English idioms. Use this translation key: