Introduction to set theory/Lecture 1

Introduction
We will start the course by introducing Propositional Logic. Even though this is a set theory class and not a logic course, most of notations from the logic courses can be used in set theory. Furthermore, logic is important in various proofs we will encounter in this course.

Notations
Here are the notations and what they mean:

Truth Table
Truth tables are used to analyze formulae of propositional logic.

Example
Truth table for $$p \to (q \to p)$$

Definition
A formula $$\theta \,\!$$ of propositional logic is a tautology if only T's occur in the $$\theta \,\!$$ column of the truth table.

Examples
Truth table for $$(p \to \lnot p) \to \lnot p = \theta$$

Truth table for $$(p \to (q \leftrightarrow \lnot q)) \to \lnot p = \theta$$

Truth table for $$(\lnot p \vee q) \to (p \to q) = \theta$$

Definition
The proposition formulas $$\varphi \,\!$$ and $$\theta \,\!$$ are tautologically equivalent  if $$\varphi \leftrightarrow \theta$$ is a tautology.

Examples
Contraposition: $$p \to q = \theta$$ is tautologically equivalent to $$\lnot q \to \lnot p = \varphi$$.

de Morgan's Law I: $$\lnot (p \lor q) = \theta$$ is tautologically equivalent to $$\lnot p \land \lnot q = \varphi$$.

de Morgan's Law II: $$\lnot (p \land q) = \theta$$ is tautologically equivalent to $$\lnot p \lor \lnot q = \varphi$$. Truth table for Assignment #1

Related Resources
The materials in this course overlap with Introductory Discrete Mathematics for Computer Science, particularly Lesson 1.