# Category:Rules of inference

Here is a list of articles in the Rules of inference category of the Computing portal that unifies foundations of mathematics and computations using computers.

The concepts described in articles in this category may be also expressed in terms of arguments, or theorems. Very often the same concept is in more than one of these categories, expressed a different way and sometimes with a different name.

## Pages in category "Rules of inference"

The following 42 pages are in this category, out of 42 total.

- Rule of inference
*(computing)*

### *

- List of rules of inference
*(computing)*

### A

- Absorption (logic)
*(philosophy)* - Admissible rule
*(computing)* - Antidistributive
*(computing)* - Associative property
*(computing)*

### B

- Biconditional elimination
*(computing)* - Biconditional introduction
*(computing)*

### C

- Commutative property
*(computing)* - Commutativity of conjunction
*(computing)* - Conjunction elimination
*(computing)* - Conjunction introduction
*(computing)* - Constructive dilemma
*(philosophy)* - Contraposition (traditional logic)
*(computing)* - Cut rule
*(computing)*

### D

- De Morgan's laws
*(computing)* - Destructive dilemma
*(philosophy)* - Disjunction elimination
*(computing)* - Disjunction introduction
*(computing)* - Disjunctive syllogism
*(computing)* - Distributive property
*(computing)* - Double negation
*(computing)*

### E

- Existential generalization
*(computing)* - Existential instantiation
*(computing)* - Exportation (logic)
*(philosophy)*

### G

- Universal generalization
*(computing)*

### H

- Hypothetical syllogism
*(computing)*

### L

- List of valid argument forms
*(computing)*

### M

- Material implication (rule of inference)
*(computing)* - Modus non excipiens
*(computing)* - Modus ponendo tollens
*(computing)* - Modus ponens
*(computing)* - Modus tollens
*(computing)*

### N

- Negation as failure
*(computing)* - Negation introduction
*(computing)*

### R

- Resolution (logic)
*(philosophy)* - Rule of replacement
*(computing)*

### S

- SLD resolution
*(computing)* - Structural rule
*(computing)*

### T

- Tautology (rule of inference)
*(computing)* - Transposition (logic)
*(philosophy)*

### U

- Universal instantiation
*(computing)*