Lecture Notes

Lectures were prepared in Apple Keynote but are given here as .pdf files.

1. Sets and Strings (4 Sept) (.pdf)
2. Propositions and Boolean Operations (6 Sept) (.pdf)
3. Set Operations and Truth Tables (9 Sept) (.pdf)
4. Rules for Propositional Proofs (11 Sept) (.pdf)
5. Propositional Proof Strategies (13 Sept) (.pdf)
6. Predicates and Relations (16 Sept) (.pdf)
7. Quantifiers and Languages (18 Sept) (.pdf)
8. Proofs With Quantifiers (20 Sept) (.pdf)
9. Relations and Functions (23 Sept) (.pdf)
10. Partial Orders (25 Sept) (.pdf)
11. Equivalence Relations (27 Sept) (.pdf)
12. Divisibility and Primes (30 Sept) (.pdf)
13. Modular Arithmetic (2 Oct) > (.pdf)
14. The Chinese Remainder Theorem (4 Oct) (.pdf)
15. The Fundamental Theorem of Arithmetic (7 Oct) (.pdf)
16. Recursive Definition (9 Oct) (.pdf)
17. Proof by Induction for Naturals (11 Oct) (.pdf)
18. Variations on Induction for Naturals (15 Oct) (.pdf)
19. Proving the Basic Facts of Arithmetic (16 Oct) (.pdf)
20. Strings and String Operations (18 Oct) (.pdf)
21. Induction for Problem Solving (21 Oct) (.pdf)
22. Graphs, Paths, and Trees (23 Oct) (.pdf)
23. Recursion on Trees (25 Oct) (.pdf)
24. General, Breadth-First, and Depth-First Search (28 Oct) (.pdf)
25. BFS and DFS on Graphs (30 Oct) (.pdf)
26. Uniform-Cost and A* Search (1 Nov) (.pdf)
27. Games and Adversary Search (4 Nov) (.pdf)
28. Regular Expressions and Their Languages (6 Nov) (.pdf)
29. Proving Regular Language Identities (8 Nov) (.pdf)
30. Proving Properties of the Regular Languages (13 Nov) (.pdf)
31. What DFA's Can and Can't Do (15 Nov) (.pdf)
32. The Myhill-Nerode Theorem (18 Nov) (.pdf)
33. NFA's and the Subset Construction (20 Nov) (.pdf)
34. Killing λ-moves: λ-NFA's to NFA's (22 Nov) (.pdf)
35. Constructing NFA's from Regular Expressions (25 Nov) (.pdf)
36. State Elimination: NFA's to Regular Expressions (27 Nov) (.pdf)
37. Two-Way Automata and Turing Machines (2 Dec) (.pdf)
38. Turing Machine Semantics (4 Dec) (.pdf)
39. The Halting Problem and Unsolvability (6 Dec) (.pdf)