Scribd
Upload
81 views

Tautologies PDF

This document lists 25 tautologies of propositional logic. Tautologies are statements that are logically true and cannot be false. Some examples included are the law of non-contradiction that ¬(P ∧ ¬P), the law of identity that P → P, De Morgan's laws about negation of conjunctions and disjunctions, and logical rules like modus ponens and modus tollens. The document provides the formal notation for each tautology and sometimes notes their common name or use.

Uploaded by

maqw123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views

Tautologies PDF

This document lists 25 tautologies of propositional logic. Tautologies are statements that are logically true and cannot be false. Some examples included are the law of non-contradiction that ¬(P ∧ ¬P), the law of identity that P → P, De Morgan's laws about negation of conjunctions and disjunctions, and logical rules like modus ponens and modus tollens. The document provides the formal notation for each tautology and sometimes notes their common name or use.

Uploaded by

maqw123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

A List of Tautologies

1. P ∨ ¬P
2. ¬ (P ∧ ¬P )
3. P →P
4. a) P ↔ (P ∨ P ) idempotent laws
b) P ↔ (P ∧ P )
5. ¬¬P ↔ P double negation
6. a) (P ∨ Q) ↔ (Q ∨ P ) commutative laws
b) (P ∧ Q) ↔ (Q ∧ P )
c) (P ↔ Q) ↔ (Q ↔ P )
7. a) (P ∨ (Q ∨ R)) ↔ ((P ∨ Q) ∨ R) associative laws
b) (P ∧ (Q ∧ R)) ↔ ((P ∧ Q) ∧ R)
8. a) (P ∧ (Q ∨ R)) ↔ ((P ∧ Q) ∨ (P ∧ R)) distributive laws
b) (P ∨ (Q ∧ R)) ↔ ((P ∨ Q) ∧ (P ∨ R))
9. a) (P ∨ C) ↔ P identity laws
b) (P ∧ C) ↔ C
c) (P ∨ T ) ↔ T
d) (P ∧ T ) ↔ P
10. a) ¬ (P ∧ Q) ↔ (¬P ∨ ¬Q) DeMorgan’s laws
b) ¬ (P ∨ Q) ↔ (¬P ∧ ¬Q)
11. a) (P ↔ Q) ↔ ((P → Q) ∧ (Q → P )) equivalence
b) (P ↔ Q) ↔ ((P ∧ Q) ∨ (¬P ∧ ¬Q))
c) (P ↔ Q) ↔ (¬P ↔ ¬Q)
12. a) (P → Q) ↔ (¬P ∨ Q) implication
b) ¬ (P → Q) ↔ (P ∧ ¬Q)
13. (P → Q) ↔ (¬Q → ¬P ) contrapositive
14. (P → Q) ↔ ((P ∧ ¬Q) → C) reductio ad absurdum
15. a) ((P → R) ∧ (Q → R)) ↔ ((P ∨ Q) → R)
b) ((P → Q) ∧ (P → R)) ↔ (P → (Q ∧ R))
c) ((P → Q) ∨ (P → R)) ↔ (P → (Q ∨ R))
16. ((P ∧ Q) → R) ↔ (P → (Q → R)) exportation law
17. P → (P ∨ Q) addition
18. (P ∧ Q) → P simplification
19. (P ∧ (P → Q)) → Q modus ponens
20. ((P → Q) ∧ ¬Q) → ¬P modus tollens
21. ((P → Q) ∧ (Q → R)) → (P → R) hypothetical syllogism
22. ((P ∨ Q) ∧ ¬P ) → Q disjunctive syllogism
23. (P → C) → ¬P absurdity
24. ((P → Q) ∧ (R → S)) → ((P ∨ R) → (Q ∨ S))
25. (P → Q) → ((P ∨ R) → (Q ∨ R))

Notes
1. T refers to any statement which is a tautology.
2. C refers to any statement which is a contradiction.
3. Item 21 is often called ”transitivity”.

You might also like