Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Disjunction elimination
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{for|the other rule of inference referred to as disjunction elimination|disjunctive syllogism}} {{Short description|Rule of inference of propositional logic}} {{Infobox mathematical statement | name = Disjunction elimination | type = [[Rule of inference]] | field = [[Propositional calculus]] | statement = If a statement <math>P</math> implies a statement <math>Q</math> and a statement <math>R</math> also implies <math>Q</math>, then if either <math>P</math> or <math>R</math> is true, then <math>Q</math> has to be true. | symbolic statement = <math>\frac{P \to Q, R \to Q, P \lor R}{\therefore Q}</math> }} {{Transformation rules}} In [[propositional logic]], '''disjunction elimination'''<ref>{{cite web|url=https://proofwiki.org/wiki/Rule_of_Or-Elimination |title=Rule of Or-Elimination - ProofWiki |access-date=2015-04-09 |url-status=dead |archive-url=https://web.archive.org/web/20150418093657/https://proofwiki.org/wiki/Rule_of_Or-Elimination |archive-date=2015-04-18 }}</ref><ref>{{cite web| url = http://www.cs.gsu.edu/~cscskp/Automata/proofs/node6.html| url-status = dead| archive-url = https://web.archive.org/web/20020307080240/http://www.cs.gsu.edu/~cscskp/Automata/proofs/node6.html| archive-date = 2002-03-07| title = Proof by cases}}</ref> (sometimes named '''proof by cases''', '''case analysis''', or '''or elimination''') is the [[Validity (logic)|valid]] [[argument form]] and [[rule of inference]] that allows one to eliminate a [[logical disjunction|disjunctive statement]] from a [[formal proof|logical proof]]. It is the [[inference]] that if a statement <math>P</math> implies a statement <math>Q</math> and a statement <math>R</math> also implies <math>Q</math>, then if either <math>P</math> or <math>R</math> is true, then <math>Q</math> 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. An example in [[English language|English]]: :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: :<math>\frac{P \to Q, R \to Q, P \lor R}{\therefore Q}</math> where the rule is that whenever instances of "<math>P \to Q</math>", and "<math>R \to Q</math>" and "<math>P \lor R</math>" appear on lines of a proof, "<math>Q</math>" can be placed on a subsequent line.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)