This lecture begins our unit on replacement rules. Some logical expressions have multiple equivalent representations. Some of these representations are more useful than others. Replacement rules allow us to freely transition between them. This means we can erase complicated expressions and use simpler ones instead.
This lecture is on the double negation. Double negation says we can replace ~~P with P (or vice versa), where P is a simple sentence or compound expression.