Simplification
| Rules of inference |
|---|
| Propositional calculus |
| Modus ponens Modus tollens Modus ponendo tollens Conjunction introduction Simplification Disjunction introduction Disjunction elimination Disjunctive syllogism Hypothetical syllogism Constructive dilemma Destructive dilemma Biconditional introduction Biconditional elimination |
| Predicate calculus |
| Universal generalization Universal instantiation Existential generalization Existential instantiation |
For other uses, see Simplification (disambiguation).
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2009) |
In mathematical logic, simplification (equivalent to conjunction elimination) is a valid argument and rule of inference which makes the inference that, if the conjunction A and B is true, then A is true, and B is true.
In formal language:
or
The argument has one premise, namely a conjunction, and one often uses simplification in longer arguments to derive one of the conjuncts.
An example in English:
- It's raining and it's pouring.
- Therefore it's raining.
 |
This logic-related article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article Simplification.
