List of rules of inference
From Wikipedia, the free encyclopedia
This is a list of rules of inference.
Contents |
[edit] Introduction
Rules of inference are syntactical transformation 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
indicates such a subderivation from the temporary assumption to .
[edit] Rules for classical sentential calculus
[edit] Rules for negations
- Reductio ad absurdum (or Negation Introduction)
- Reductio ad absurdum (related to the law of excluded middle)
- Noncontradiction (or Negation Elimination)
[edit] Rules for conditionals
- Modus ponens (or Conditional Elimination)
[edit] Rules for conjunctions
- Adjunction (or Conjunction Introduction)
- Simplification (or Conjunction Elimination)
[edit] Rules for disjunctions
- Addition (or Disjunction Introduction)
- Separation of Cases (or Disjunction Elimination)
[edit] Rules for biconditionals
- Biconditional Elimination
[edit] Rules of classical predicate calculus
In the following rules, is exactly like except for having the free term everywhere has the free variable .
- Universal Introduction (or Universal Generalization)
Restriction: does not occur free in or in any non-discharged assumption.
- Universal Elimination (or Universal Instantiation)
- Existential Introduction (or Existential Generalization)
- Existential Elimination (or Existential Instantiation)
Restriction: does not occur free in , in or in any non-discharged assumption.