Valid Argument Forms

Why This Matters

Valid argument forms are the moves you're allowed to make when constructing a proof or evaluating someone else's reasoning. In Formal Logic I, you need to recognize these forms, apply them correctly in proofs, and understand why each inference is truth-preserving. None of these rules are arbitrary: each one captures a relationship between logical connectives that guarantees if your premises are true, your conclusion must be true.

These forms fall into distinct categories: inference rules that let you derive new statements, equivalence rules that let you swap logically identical expressions, and quantifier rules that bridge general claims and specific instances. Don't just memorize the symbolic patterns. Know what logical principle each form exploits and when to reach for it in a proof.

---

Conditional Inference Rules

These rules govern how we reason with "if-then" statements (conditionals). The conditional $P \rightarrow Q$ creates a one-way logical dependency, and these rules show you exactly how to exploit that dependency.

Modus Ponens

• Affirm the antecedent, derive the consequent: from $P \rightarrow Q$ and $P$, conclude $Q$
• This is the most fundamental inference rule in propositional logic. You'll use it constantly in proofs.
• Pattern recognition tip: look for a conditional and its antecedent appearing separately in your premises

Modus Tollens

• Deny the consequent, derive the negation of the antecedent: from $P \rightarrow Q$ and $\neg Q$, conclude $\neg P$
• Essential for indirect reasoning and disproving hypotheses. It's the contrapositive in action.
• Common exam trap: students confuse this with the invalid form "denying the antecedent" ($P \rightarrow Q$, $\neg P$, therefore $\neg Q$). That's a fallacy, not a rule.

Hypothetical Syllogism

• Chain conditionals together: from $P \rightarrow Q$ and $Q \rightarrow R$, derive $P \rightarrow R$
• This is the transitivity of implication. It lets you build longer inferential chains from shorter ones.
• Proof strategy: use this to connect distant premises when you see a "bridge" variable appearing as the consequent of one conditional and the antecedent of another

---

Disjunction Rules

These rules handle "or" statements (disjunctions). The disjunction $P \lor Q$ asserts that at least one disjunct is true. These rules let you either eliminate options or introduce new ones.

Disjunctive Syllogism

• Eliminate one disjunct to conclude the other: from $P \lor Q$ and $\neg P$, derive $Q$
• This is process of elimination formalized. If it's not this one, it must be that one.
• Proof tip: when you have a disjunction and can derive the negation of one side, this rule closes the gap

Addition

• Introduce a disjunction from any true statement: from $P$, derive $P \lor Q$ for any $Q$
• This seems oddly permissive, but it's logically valid. Adding alternatives never makes a true statement false.
• Strategic use: often needed to set up Constructive Dilemma or to match a desired conclusion form

Constructive Dilemma

• Combine two conditionals with a disjunction: from $P \rightarrow Q$, $R \rightarrow S$, and $P \lor R$, derive $Q \lor S$
• Think of it as "fork in the road" reasoning. Either way leads somewhere, so one of those destinations is reached.
• Look for this when you have multiple conditionals and need to preserve optionality in your conclusion

Destructive Dilemma

• The contrapositive version of Constructive Dilemma: from $P \rightarrow Q$, $R \rightarrow S$, and $\neg Q \lor \neg S$, derive $\neg P \lor \neg R$
• It eliminates antecedents when consequents fail. If neither outcome happened, neither cause occurred.
• Less common in basic proofs but essential for understanding the symmetry of dilemma reasoning

---

Conjunction Rules

These rules govern "and" statements (conjunctions). The conjunction $P \land Q$ requires both conjuncts to be true, so you can build them from separate truths or break them apart.

Conjunction

• Combine two true statements: from $P$ and $Q$ (separately established), derive $P \land Q$
• This is the only way to introduce $\land$ in a proof. You must have proven both parts independently.
• Proof tip: often the final step when your conclusion is a conjunction

Simplification

• Extract either conjunct: from $P \land Q$, derive $P$ (or derive $Q$)
• Use this to break apart compound premises and access the pieces you need for other rules.
• Don't overlook this one. Students sometimes forget they can "unpack" conjunctions mid-proof.

---

Equivalence Rules: Negation and Transformation

Equivalence rules let you replace expressions with logically identical alternatives. Unlike inference rules, equivalences work in both directions and can be applied to subformulas within larger expressions.

Double Negation

• Two negations cancel out: $\neg \neg P \equiv P$
• Works both ways. You can introduce or eliminate double negations as needed.
• Frequently necessary to set up Modus Tollens or clean up after other transformations

De Morgan's Laws

• Distribute negation across connectives:
  • $\neg(P \land Q) \equiv (\neg P \lor \neg Q)$
  • $\neg(P \lor Q) \equiv (\neg P \land \neg Q)$
• The key pattern: negation flips the connective. And becomes or, or becomes and.
• These appear constantly on exams. Practice until the transformation is automatic.

Transposition (Contraposition)

• Flip and negate a conditional: $P \rightarrow Q \equiv \neg Q \rightarrow \neg P$
• This is the logical basis for Modus Tollens. Both forms say exactly the same thing.
• Proof strategy: transpose when you have the negation of a consequent and need to set up a forward inference

Material Implication

• Rewrite conditionals as disjunctions: $P \rightarrow Q \equiv \neg P \lor Q$
• This reveals the "hidden or" inside every if-then statement.
• Use this when you need to apply disjunction rules to a conditional or vice versa.

---

Equivalence Rules: Structure and Rearrangement

These rules let you reorganize logical expressions without changing their truth value. They're about flexibility in how you write formulas, not about deriving new information.

Commutation

• Order doesn't matter for $\land$ and $\lor$:
  • $P \land Q \equiv Q \land P$
  • $P \lor Q \equiv Q \lor P$
• Use this to rearrange conjunctions and disjunctions to match required forms.
• Note: this does NOT apply to conditionals. $P \rightarrow Q$ is not equivalent to $Q \rightarrow P$.

Association

• Grouping doesn't matter for repeated connectives:
  • $(P \land Q) \land R \equiv P \land (Q \land R)$
  • $(P \lor Q) \lor R \equiv P \lor (Q \lor R)$
• Regrouping parentheses lets you access different pairs for other rules.

Distribution

• Distribute one connective over another:
  • $P \land (Q \lor R) \equiv (P \land Q) \lor (P \land R)$
  • $P \lor (Q \land R) \equiv (P \lor Q) \land (P \lor R)$
• Works both directions and for both connective combinations, like distributing multiplication over addition.
• This is a key transformation for converting between conjunctive and disjunctive normal forms.

Absorption

• A statement absorbs redundant information: $P \rightarrow Q \equiv P \rightarrow (P \land Q)$
• If $P$ guarantees $Q$, then $P$ guarantees both $P$ and $Q$. The antecedent is already "included."
• Useful for simplification or when you need to introduce a conjunction into a consequent.

---

Advanced Forms and Concepts

These forms extend beyond basic propositional logic or represent important logical concepts you'll encounter throughout your studies.

Exportation

• Restructure nested implications: $(P \land Q) \rightarrow R \equiv P \rightarrow (Q \rightarrow R)$
• A conjunction in the antecedent can be "exported" into a chain of conditionals, and vice versa.
• Proof flexibility: choose whichever form makes your current inference easier

Universal Instantiation

• Apply general claims to specific cases: from $\forall x \, Px$, derive $Pa$ for any constant $a$
• This is the bridge from predicate logic to propositional reasoning. What's true of all is true of each.
• You'll use this whenever you need to "unpack" a universal statement to work with a specific individual.

Tautology

• A statement true under all interpretations, like $P \lor \neg P$ (the law of excluded middle)
• This isn't an inference rule but a concept. Tautologies can be introduced at any point in a proof since they're always true.
• Validity connection: an argument is valid if and only if the conditional linking its conjoined premises to its conclusion is a tautology.

---

Quick Reference Table

---

Self-Check Questions

1. Both Modus Ponens and Modus Tollens use a conditional premise. What additional premise does each require, and what conclusion does each produce?

2. You have the premises $P \rightarrow Q$, $Q \rightarrow R$, and $P$. Which two rules would you use (in order) to derive $R$?

3. Compare De Morgan's Laws and Distribution: both transform expressions with mixed connectives. When would you use each one?

4. If you need to derive $\neg P$ and you have $P \rightarrow Q$ as a premise, what other premise do you need and which rule applies?

5. (FRQ-style) Given premises $A \rightarrow B$, $C \rightarrow D$, and $A \lor C$, construct a proof deriving $B \lor D$. Name each rule you apply.