1. Translate from English to FOL (and vice versa) using negation, conjunction, and disjunction. (Like 3.21 and 3.24)
2. Build "worlds" that make all the sentences (using not, and, and or) in a short list true.
3. Give the truth tables for negation, conjunction, and disjunction.
4. Look at a world and tell whether sentences using negation, conjunction, and disjunction are 1) sentences, 2) evaluable, and 3) true or false.
5. Identify the main connective in longer sentences with parentheses.
6. Build truth tables for sentences containing up to 3 atomic sentences. (8 rows)
7. Use a truth table to identify whether a sentence is a tautology or not., and whether it is TT-possible or not.
8. Identify sentences that are TW-possible, and build a world to prove it.
9. Understand equivalent ways of saying things in Tarski's World (3.18)
10. Use joint truth tables to show that a sentence is/is not a consequence of other sentences.
11. Use joint truth tables to show that a pair of sentences are/are not equivalent.
12. Use joint truth tables to show that a pair of sentences are TT-contradictory.
13. Properly use Taut Con and Ana Con in a short proof.