The document presents proofs of logical equivalences using sentential logic. It provides proofs for the following equivalences:
1. (P ∧ Q) ≡ ¬(¬P ∨ ¬Q)
2. (P ∧ Q) ≡ ¬(P → ¬Q)
3. (P ∨ Q) ≡ ¬P → Q
4. P ≡ ((P ∧ Q) ∨ (P ∧ ¬Q))
5. ¬(P → Q) ≡ (P ∧ ¬Q)
Each proof uses rules of inference such as proof by contradiction (RAA) and