List of rules of inference
| Transformation rules |
|---|
| Propositional calculus |
| Rules of inference |
| Rules of replacement |
| Predicate logic |
This is a list of rules of inference, logical laws that relate to mathematical formulae.
Introduction
Rules of inference are syntactical transform rules which one can use to infer a conclusion from a premise to create an argument. A set of rules can be used to infer any valid conclusion if it is complete, while never inferring an invalid conclusion, if it is sound. A sound and complete set of rules need not include every rule in the following list, as many of the rules are redundant, and can be proven with the other rules.
Discharge rules permit inference from a subderivation based on a temporary assumption. Below, the notation
- [math]\displaystyle{ \varphi \vdash \psi }[/math]
indicates such a subderivation from the temporary assumption [math]\displaystyle{ \varphi }[/math] to [math]\displaystyle{ \psi }[/math].
Rules for propositional calculus
Rules for negations
- Reductio ad absurdum (or Negation Introduction)
- [math]\displaystyle{ \varphi \vdash \psi }[/math]
- [math]\displaystyle{ \underline{\varphi \vdash \lnot \psi} }[/math]
- [math]\displaystyle{ \lnot \varphi }[/math]
- Reductio ad absurdum (related to the law of excluded middle)
- [math]\displaystyle{ \lnot \varphi \vdash \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \varphi \vdash \lnot \psi} }[/math]
- [math]\displaystyle{ \varphi }[/math]
- Ex contradictione quodlibet
- [math]\displaystyle{ \varphi }[/math]
- [math]\displaystyle{ \underline{\lnot \varphi} }[/math]
- [math]\displaystyle{ \psi }[/math]
Rules for conditionals
- Deduction theorem (or Conditional Introduction)
- [math]\displaystyle{ \underline{\varphi \vdash \psi} }[/math]
- [math]\displaystyle{ \varphi \rightarrow \psi }[/math]
- Modus ponens (or Conditional Elimination)
- [math]\displaystyle{ \varphi \rightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\varphi \quad \quad \quad} }[/math]
- [math]\displaystyle{ \psi }[/math]
- Modus tollens
- [math]\displaystyle{ \varphi \rightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \psi \quad \quad \quad} }[/math]
- [math]\displaystyle{ \lnot \varphi }[/math]
Rules for conjunctions
- [math]\displaystyle{ \varphi }[/math]
- [math]\displaystyle{ \underline{\psi \quad \quad \ \ } }[/math]
- [math]\displaystyle{ \varphi \land \psi }[/math]
- Simplification (or Conjunction Elimination)
- [math]\displaystyle{ \underline{\varphi \land \psi} }[/math]
- [math]\displaystyle{ \varphi }[/math]
- [math]\displaystyle{ \underline{\varphi \land \psi} }[/math]
- [math]\displaystyle{ \psi }[/math]
Rules for disjunctions
- Addition (or Disjunction Introduction)
- [math]\displaystyle{ \underline{\varphi \quad \quad \ \ } }[/math]
- [math]\displaystyle{ \varphi \lor \psi }[/math]
- [math]\displaystyle{ \underline{\psi \quad \quad \ \ } }[/math]
- [math]\displaystyle{ \varphi \lor \psi }[/math]
- Case analysis (or Proof by Cases or Argument by Cases or Disjunction elimination)
- [math]\displaystyle{ \varphi \rightarrow \chi }[/math]
- [math]\displaystyle{ \psi \rightarrow \chi }[/math]
- [math]\displaystyle{ \underline{\varphi \lor \psi} }[/math]
- [math]\displaystyle{ \chi }[/math]
- Disjunctive syllogism
- [math]\displaystyle{ \varphi \lor \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \varphi \quad \quad} }[/math]
- [math]\displaystyle{ \psi }[/math]
- [math]\displaystyle{ \varphi \lor \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \psi \quad \quad} }[/math]
- [math]\displaystyle{ \varphi }[/math]
- Constructive dilemma
- [math]\displaystyle{ \varphi \rightarrow \chi }[/math]
- [math]\displaystyle{ \psi \rightarrow \xi }[/math]
- [math]\displaystyle{ \underline{\varphi \lor \psi} }[/math]
- [math]\displaystyle{ \chi \lor \xi }[/math]
Rules for biconditionals
- Biconditional introduction
- [math]\displaystyle{ \varphi \rightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\psi \rightarrow \varphi} }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- Biconditional elimination
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\varphi \quad \quad} }[/math]
- [math]\displaystyle{ \psi }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\psi \quad \quad} }[/math]
- [math]\displaystyle{ \varphi }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \varphi \quad \quad} }[/math]
- [math]\displaystyle{ \lnot \psi }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \psi \quad \quad} }[/math]
- [math]\displaystyle{ \lnot \varphi }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\psi \lor \varphi} }[/math]
- [math]\displaystyle{ \psi \land \varphi }[/math]
- [math]\displaystyle{ \varphi \leftrightarrow \psi }[/math]
- [math]\displaystyle{ \underline{\lnot \psi \lor \lnot \varphi} }[/math]
- [math]\displaystyle{ \lnot \psi \land \lnot \varphi }[/math]
Rules of classical predicate calculus
In the following rules, [math]\displaystyle{ \varphi(\beta / \alpha) }[/math] is exactly like [math]\displaystyle{ \varphi }[/math] except for having the term [math]\displaystyle{ \beta }[/math] wherever [math]\displaystyle{ \varphi }[/math] has the free variable [math]\displaystyle{ \alpha }[/math].
- Universal Generalization (or Universal Introduction)
- [math]\displaystyle{ \underline{\varphi{(\beta / \alpha)}} }[/math]
- [math]\displaystyle{ \forall \alpha\, \varphi }[/math]
Restriction 1: [math]\displaystyle{ \beta }[/math] is a variable which does not occur in [math]\displaystyle{ \varphi }[/math].
Restriction 2: [math]\displaystyle{ \beta }[/math] is not mentioned in any hypothesis or undischarged assumptions.
- Universal Instantiation (or Universal Elimination)
- [math]\displaystyle{ \forall \alpha\, \varphi }[/math]
- [math]\displaystyle{ \overline{\varphi{(\beta / \alpha)}} }[/math]
Restriction: No free occurrence of [math]\displaystyle{ \alpha }[/math] in [math]\displaystyle{ \varphi }[/math] falls within the scope of a quantifier quantifying a variable occurring in [math]\displaystyle{ \beta }[/math].
- Existential Generalization (or Existential Introduction)
- [math]\displaystyle{ \underline{\varphi(\beta / \alpha)} }[/math]
- [math]\displaystyle{ \exists \alpha\, \varphi }[/math]
Restriction: No free occurrence of [math]\displaystyle{ \alpha }[/math] in [math]\displaystyle{ \varphi }[/math] falls within the scope of a quantifier quantifying a variable occurring in [math]\displaystyle{ \beta }[/math].
- Existential Instantiation (or Existential Elimination)
- [math]\displaystyle{ \exists \alpha\, \varphi }[/math]
- [math]\displaystyle{ \underline{\varphi(\beta / \alpha) \vdash \psi} }[/math]
- [math]\displaystyle{ \psi }[/math]
Restriction 1: [math]\displaystyle{ \beta }[/math] is a variable which does not occur in [math]\displaystyle{ \varphi }[/math].
Restriction 2: There is no occurrence, free or bound, of [math]\displaystyle{ \beta }[/math] in [math]\displaystyle{ \psi }[/math].
Restriction 3: [math]\displaystyle{ \beta }[/math] is not mentioned in any hypothesis or undischarged assumptions.
Rules of substructural logic
The following are special cases of universal generalization and existential elimination; these occur in substructural logics, such as linear logic.
- Rule of weakening (or monotonicity of entailment) (aka no-cloning theorem)
- [math]\displaystyle{ \alpha\vdash\beta }[/math]
- [math]\displaystyle{ \overline{\alpha,\alpha\vdash\beta} }[/math]
- Rule of contraction (or idempotency of entailment) (aka no-deleting theorem)
- [math]\displaystyle{ \underline{\alpha,\alpha,\gamma\vdash\beta} }[/math]
- [math]\displaystyle{ \alpha,\gamma\vdash\beta }[/math]
Table: Rules of Inference
The rules above can be summed up in the following table.[1] The "Tautology" column shows how to interpret the notation of a given rule.
| Rules of inference | Tautology | Name |
|---|---|---|
| [math]\displaystyle{ \begin{align} p\\ p \rightarrow q\\ \therefore \overline{q \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ (p \wedge (p \rightarrow q)) \rightarrow q }[/math] | Modus ponens |
| [math]\displaystyle{ \begin{align} \neg q\\ p \rightarrow q\\ \therefore \overline{\neg p \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ (\neg q \wedge (p \rightarrow q)) \rightarrow \neg p }[/math] | Modus tollens |
| [math]\displaystyle{ \begin{align} p \rightarrow q\\ q \rightarrow r\\ \therefore \overline{p \rightarrow r} \\ \end{align} }[/math] | [math]\displaystyle{ ((p \rightarrow q) \wedge (q \rightarrow r)) \rightarrow (p \rightarrow r) }[/math] | Hypothetical syllogism |
| [math]\displaystyle{ \begin{align} p \rightarrow q\\ \therefore \overline{p \rightarrow (p \wedge q)} \\ \end{align} }[/math] | [math]\displaystyle{ (p \rightarrow q) \rightarrow (p \rightarrow (p \wedge q)) }[/math] | Absorption |
| [math]\displaystyle{ \begin{align} p\\ q\\ \therefore \overline{p \wedge q} \\ \end{align} }[/math] | [math]\displaystyle{ ((p) \wedge (q)) \rightarrow (p \wedge q) }[/math] | Conjunction introduction |
| [math]\displaystyle{ \begin{align} p \wedge q \\ \therefore \overline{p \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ (p \wedge q) \rightarrow p }[/math] | Conjunction elimination |
| [math]\displaystyle{ \begin{align} p \\ \therefore \overline{p \vee q} \\ \end{align} }[/math] | [math]\displaystyle{ p \rightarrow (p \vee q) }[/math] | Disjunction introduction |
| [math]\displaystyle{ \begin{align} p \rightarrow q\\ r \rightarrow q\\ p \vee r\\ \therefore \overline{q \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ ((p \rightarrow q) \wedge (r \rightarrow q) \wedge (p \vee r)) \rightarrow q }[/math] | Disjunction elimination |
| [math]\displaystyle{ \begin{align} p \vee q \\ \neg p \\ \therefore \overline{q \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ ((p \vee q) \wedge \neg p) \rightarrow q }[/math] | Disjunctive syllogism |
| [math]\displaystyle{ \begin{align} p \vee p \\ \therefore \overline{p \quad \quad \quad} \\ \end{align} }[/math] | [math]\displaystyle{ (p \vee p) \rightarrow p }[/math] | Disjunctive simplification |
| [math]\displaystyle{ \begin{align} p \vee q \\ \neg p \vee r \\ \therefore \overline{q \vee r} \\ \end{align} }[/math] | [math]\displaystyle{ ((p \vee q) \wedge (\neg p \vee r)) \rightarrow (q \vee r) }[/math] | Resolution |
| [math]\displaystyle{ \begin{align} p \rightarrow q\\ q \rightarrow p\\ \therefore \overline{p \leftrightarrow q} \\ \end{align} }[/math] | [math]\displaystyle{ ((p \rightarrow q) \wedge (q \rightarrow p)) \rightarrow (p \leftrightarrow q) }[/math] | Biconditional introduction |
All rules use the basic logic operators. A complete table of "logic operators" is shown by a truth table, giving definitions of all the possible (16) truth functions of 2 boolean variables (p, q):
| p | q | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| T | T | F | F | F | F | F | F | F | F | T | T | T | T | T | T | T | T | ||
| T | F | F | F | F | F | T | T | T | T | F | F | F | F | T | T | T | T | ||
| F | T | F | F | T | T | F | F | T | T | F | F | T | T | F | F | T | T | ||
| F | F | F | T | F | T | F | T | F | T | F | T | F | T | F | T | F | T |
where T = true and F = false, and, the columns are the logical operators:
- 0, false, Contradiction;
- 1, NOR, Logical NOR (Peirce's arrow);
- 2, Converse nonimplication;
- 3, ¬p, Negation;
- 4, Material nonimplication;
- 5, ¬q, Negation;
- 6, XOR, Exclusive disjunction;
- 7, NAND, Logical NAND (Sheffer stroke);
- 8, AND, Logical conjunction;
- 9, XNOR, If and only if, Logical biconditional;
- 10, q, Projection function;
- 11, if/then, Material conditional;
- 12, p, Projection function;
- 13, then/if, Converse implication;
- 14, OR, Logical disjunction;
- 15, true, Tautology.
Each logic operator can be used in an assertion about variables and operations, showing a basic rule of inference. Examples:
- The column-14 operator (OR), shows Addition rule: when p=T (the hypothesis selects the first two lines of the table), we see (at column-14) that p∨q=T.
- We can see also that, with the same premise, another conclusions are valid: columns 12, 14 and 15 are T.
- The column-8 operator (AND), shows Simplification rule: when p∧q=T (first line of the table), we see that p=T.
- With this premise, we also conclude that q=T, p∨q=T, etc. as shown by columns 9–15.
- The column-11 operator (IF/THEN), shows Modus ponens rule: when p→q=T and p=T only one line of the truth table (the first) satisfies these two conditions. On this line, q is also true. Therefore, whenever p → q is true and p is true, q must also be true.
Machines and well-trained people use this look at table approach to do basic inferences, and to check if other inferences (for the same premises) can be obtained.
Example 1
Consider the following assumptions: "If it rains today, then we will not go on a canoe today. If we do not go on a canoe trip today, then we will go on a canoe trip tomorrow. Therefore (Mathematical symbol for "therefore" is [math]\displaystyle{ \therefore }[/math]), if it rains today, we will go on a canoe trip tomorrow". To make use of the rules of inference in the above table we let [math]\displaystyle{ p }[/math] be the proposition "If it rains today", [math]\displaystyle{ q }[/math] be "We will not go on a canoe today" and let [math]\displaystyle{ r }[/math] be "We will go on a canoe trip tomorrow". Then this argument is of the form:
[math]\displaystyle{ \begin{align} p \rightarrow q\\ q \rightarrow r\\ \therefore \overline{p \rightarrow r} \\ \end{align} }[/math]
Example 2
Consider a more complex set of assumptions: "It is not sunny today and it is colder than yesterday". "We will go swimming only if it is sunny", "If we do not go swimming, then we will have a barbecue", and "If we will have a barbecue, then we will be home by sunset" lead to the conclusion "We will be home by sunset." Proof by rules of inference: Let [math]\displaystyle{ p }[/math] be the proposition "It is sunny today", [math]\displaystyle{ q }[/math] the proposition "It is colder than yesterday", [math]\displaystyle{ r }[/math] the proposition "We will go swimming", [math]\displaystyle{ s }[/math] the proposition "We will have a barbecue", and [math]\displaystyle{ t }[/math] the proposition "We will be home by sunset". Then the hypotheses become [math]\displaystyle{ \neg p \wedge q, r \rightarrow p, \neg r \rightarrow s }[/math] and [math]\displaystyle{ s \rightarrow t }[/math]. Using our intuition we conjecture that the conclusion might be [math]\displaystyle{ t }[/math]. Using the Rules of Inference table we can prove the conjecture easily:
| Step | Reason |
|---|---|
| 1.[math]\displaystyle{ \neg p \wedge q }[/math] | Hypothesis |
| 2. [math]\displaystyle{ \neg p }[/math] | Simplification using Step 1 |
| 3. [math]\displaystyle{ r \rightarrow p }[/math] | Hypothesis |
| 4. [math]\displaystyle{ \neg r }[/math] | Modus tollens using Step 2 and 3 |
| 5. [math]\displaystyle{ \neg r \rightarrow s }[/math] | Hypothesis |
| 6. [math]\displaystyle{ s }[/math] | Modus ponens using Step 4 and 5 |
| 7. [math]\displaystyle{ s \rightarrow t }[/math] | Hypothesis |
| 8. [math]\displaystyle{ t }[/math] | Modus ponens using Step 6 and 7 |
See also
- List of logic systems
- Modus ponendo tollens
References
- ↑ Kenneth H. Rosen: Discrete Mathematics and its Applications, Fifth Edition, p. 58.
de:Schlussregel he:חוקי היקש
 |  |
