Disjunction introduction

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

Disjunction introduction or addition (also called or introduction)^[1]^[2]^[3] is a rule of inference of propositional logic and almost every other deduction system. The rule makes it possible to introduce disjunctions to logical proofs. It is the inference that if P is true, then P or Q must be true.

Socrates is a man.

Therefore, either Socrates is a man or pigs are flying in formation over the English Channel.

The rule can be expressed as:

\frac{P}{\therefore P \or Q}

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

More generally it's also a simple valid argument form, this means that if the premise is true, then the conclusion is also true as any rule of inference should be, and an immediate inference, as it has a single proposition in its premises.

Disjunction introduction is not a rule in some paraconsistent logics because in combination with other rules of logic, it leads to explosion (i.e. everything becomes provable) and paraconsistent logic tries to avoid explosion and to be able to reason with contradictions. One of the solutions is to introduce disjunction with over rules. See Tradeoffs in Paraconsistent logic.

Formal notation

The disjunction introduction rule may be written in sequent notation:

P \vdash (P \or Q)

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

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

P \to (P \or Q)

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

References

↑ Hurley
↑ Moore and Parker
↑ Copi and Cohen

This article is issued from Wikipedia - version of the 11/9/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.