Types of Propositional Equivalences
- Logical equivalences
A tautology is a statement that is always true.
For more details, please contact me here.
- ¬(R∧Q) ↔ (¬P) ∨ (¬Q)
- Excercise: Check that the above statements are always true
- If S → T is a tautology, we write S ⇒ T
- If S ↔ T is a tautology, we write S ⇔ T
Tautologies and Contradictions
The negation of any tautology is a contradiction, and the negation of any contradiction is a tautology.
Exercise: Check if the following contradictions are always false:
- R ∧ (¬R)
A contigency is a proposition that is neither a contradiction nor a tautology.
Example: R ∨ S → ¬T
Date of last modification: February 12, 2019