HOME

TheInfoList



OR:

Disjunction introduction or addition (also called or introduction) is a
rule of inference Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the Logical form, logical structure of Validity (logic), valid arguments. If an argument with true premises follows a ...
of
propositional logic The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
and almost every other
deduction system A formal system is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms. In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in math ...
. The rule makes it possible to introduce disjunctions to logical proofs. It is the
inference Inferences are steps in logical reasoning, moving from premises to logical consequences; etymologically, the word '' infer'' means to "carry forward". Inference is theoretically traditionally divided into deduction and induction, a distinct ...
that if ''P'' is true, then ''P or Q'' must be true. An example in English: :Socrates is a man. :Therefore, Socrates is a man or pigs are flying in formation over the English Channel. The rule can be expressed as: :\frac 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 In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system. Informally, the logical form attempts to formalize a possibly ambiguous statement into a statement with a precise, unamb ...
, 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 An immediate inference is an inference which can be made from only one statement or proposition. For instance, from the statement "All toads are green", the immediate inference can be made that "no toads are not green" or "no toads are non-green" ( ...
, as it has a single proposition in its premises. Disjunction introduction is not a rule in some
paraconsistent logic Paraconsistent logic is a type of non-classical logic that allows for the coexistence of contradictory statements without leading to a logical explosion where anything can be proven true. Specifically, paraconsistent logic is the subfield of log ...
s because in combination with other rules of logic, it leads to
explosion An explosion is a rapid expansion in volume of a given amount of matter associated with an extreme outward release of energy, usually with the generation of high temperatures and release of high-pressure gases. Explosions may also be generated ...
(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 .


Formal notation

The ''disjunction introduction'' rule may be written in sequent notation: : P \vdash (P \lor Q) where \vdash is a
metalogic Metalogic is the metatheory of logic. Whereas ''logic'' studies how logical systems can be used to construct valid and sound arguments, metalogic studies the properties of logical systems. Logic concerns the truths that may be derived using a lo ...
al symbol meaning that P \lor Q is a syntactic consequence of P in some
logical system A formal system is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms. In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in math ...
; and expressed as a truth-functional tautology or
theorem In mathematics and formal logic, a theorem is a statement (logic), statement that has been Mathematical proof, proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to esta ...
of propositional logic: :P \to (P \lor Q) where P and Q are propositions expressed in some
formal system A formal system is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms. In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in ma ...
.


References

{{DEFAULTSORT:Disjunction Introduction Rules of inference Paraconsistent logic Theorems in propositional logic