Category:Rules of inference

• 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)