Logic

Lots ofconnectives

In lecture (9/7/2022)
 * 1) Conjunction
 * 2) Dysjunction (or)
 * 3) implication
 * 4) equivalence
 * 5) negation (written as ' prime in this class)

9/9
A well formed formula is a formula that is valid in symbolic logic

~A^A is a well formed formula despite being a contradiction

The main connective is the last connective which is applied in a formula

Definitions are proofs by tautology