Category:Theorems in propositional logic
 | Philosophy portal |
Here is a list of articles in the category Theorems in propositional logic of the Philosophy portal.
 |
Wikimedia Commons has media related to Theorems in propositional logic. |
Pages in category "Theorems in propositional logic"
The following 39 pages are in this category, out of 39 total.
A
- Absorption (logic) (philosophy)
- Absorption law (computing)
B
- Biconditional elimination (computing)
- Biconditional introduction (computing)
C
- Commutativity of conjunction (computing)
- Conjunction elimination (computing)
- Conjunction introduction (computing)
- Consensus theorem (computing)
- Consequentia mirabilis (philosophy)
- Constructive dilemma (philosophy)
- Contraposition (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
- Exportation (logic) (philosophy)
F
- Frege's theorem (computing)
H
- Hypothetical syllogism (computing)
I
- Idempotency of entailment (philosophy)
L
- Law of excluded middle (computing)
- Law of noncontradiction (philosophy)
M
- Material implication (rule of inference) (computing)
- Modus non excipiens (computing)
- Modus ponendo tollens (computing)
- Modus ponens (computing)
- Modus tollens (computing)
- Monotonicity of entailment (philosophy)
N
- Nicod's axiom (computing)
P
- Peirce's law (computing)
- Principle of explosion (philosophy)
- Proof by contradiction (computing)
R
- Reductio ad absurdum (philosophy)
- Resolution (logic) (philosophy)
S
- William of Soissons (philosophy)
T
- Tautology (rule of inference) (computing)
- Transposition (logic) (philosophy)
Mathematics
Organizations
Books
About