Disjunction elimination

From Wikipedia, the free encyclopedia

Transformation rules
Propositional calculus
Rules of inference Modus ponens Modus tollens Biconditional introduction Biconditional elimination Conjunction introduction Simplification Disjunction introduction Disjunction elimination Disjunctive syllogism Hypothetical syllogism Constructive dilemma Destructive dilemma Absorption Rules of replacement Associativity Commutativity Distributivity Double negation De Morgan's laws Transposition Material implication Material equivalence Exportation Tautology
Predicate logic
Universal generalization Universal instantiation Existential generalization Existential instantiation
v t e

For the theorem of propositional logic which expresses Disjunction elimination, see Case analysis.

In propositional logic, disjunction elimination^[1]^[2]^[3] (sometimes named proof by cases or case analysis), is the valid argument form and rule of inference that allows one to eliminate a disjunctive statement from a logical proof. It is the inference that if a statement $P$ implies a statement $Q$ and a statement $R$ also implies $Q$ , then if either $P$ or $R$ is true, then $Q$ has to be true. The reasoning is simple: since at least one of the statements P and R is true, and since either of them would be sufficient to entail Q, Q is certainly true.

If I'm inside, I have my wallet on me.

If I'm outside, I have my wallet on me.

It is true that either I'm inside or I'm outside.

Therefore, I have my wallet on me.

It is the rule can be stated as:

${\frac {P\to Q,R\to Q,P\lor R}{\therefore Q}}$

where the rule is that whenever instances of " $P\to Q$ ", and " $R\to Q$ " and " $P\lor R$ " appear on lines of a proof, " $Q$ " can be placed on a subsequent line.

Formal notation

The disjunction elimination rule may be written in sequent notation:

$(P\to Q),(R\to Q),(P\lor R)\vdash Q$

where $\vdash$ is a metalogical symbol meaning that $Q$ is a syntactic consequence of $P\to Q$ , and $R\to Q$ and $P\lor R$ in some logical system;

and expressed as a truth-functional tautology or theorem of propositional logic:

$(((P\to Q)\land (R\to Q))\land (P\lor R))\to Q$

where $P$ , $Q$ , and $R$ are propositions expressed in some formal system.

References

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.

Disjunction elimination

Formal notation

See also

References