- Disjunction elimination
-
Rules of inference Propositional calculus Modus ponens (A→B, A ⊢ B)
Modus tollens (A→B, ¬B ⊢ ¬A)
Modus ponendo tollens (¬(A∧B), A ⊢ ¬B)
Conjunction introduction (A, B ⊢ A∧B)
Simplification (A∧B ⊢ A)
Disjunction introduction (A ⊢ A∨B)
Disjunction elimination (A∨B, A→C, B→C ⊢ C)
Disjunctive syllogism (A∨B, ¬A ⊢ B)
Hypothetical syllogism (A→B, B→C ⊢ A→C)
Constructive dilemma (A→P, B→Q, A∨B ⊢ P∨Q)
Destructive dilemma (A→P, B→Q, ¬P∨¬Q ⊢ ¬A∨¬B)
Biconditional introduction (A→B, B→A ⊢ A↔B)
Biconditional elimination (A↔B ⊢ A→B)Predicate calculus Universal generalization
Universal instantiation
Existential generalization
Existential instantiationIn propositional logic disjunction elimination, or proof by cases, is the inference that, if "A or B" is true, and A entails C, and B entails C, then we may justifiably infer C. The reasoning is simple: since at least one of the statements A and B is true, and since either of them would be sufficient to entail C, C is certainly true.
For example:
- It is true that either I'm inside or I'm outside. It is also true that if I'm inside, I have my wallet on me. It's also true that if I'm outside, I have my wallet on me. Given these three premises, it follows that I have my wallet on me.
Formally:
See also
- Disjunction
- Argument in the alternative
- Disjunct normal form
Categories:- Rules of inference
- Logic
Wikimedia Foundation. 2010.