Class: CSE 16 Subject: computer-science discrete-math Date: 2024-10-07 Teacher: Prof. Musacchio
Logic
Logical Connectives
- Suppose P and Q are statements
- P Q ⇒ Conjunction(and)
- P Q ⇒ Disjunction(or)
- ~ P ⇒ Not(not)
Truth Table
| P | Q | P Q | P Q | ~ P |
|---|---|---|---|---|
| T | T | T | T | F |
| T | F | F | T | F |
| F | T | F | T | T |
| F | F | F | F | T |
Exclusive Or (XOR)
- P \newcommand*\xor{\oplus} Q = (P Q) (~ P Q) - create truth table later