Lectures info#
Lectures are at the core of this course and are designed to be engaging. Lectures will be on-campus.
Lecture Schedule#
- Week 1: Propositional Logic
- Week 2: Natural Deduction (and Introduction to First Order Logic)
- Week 3: First Order Logic and Natural Deduction
- Week 4: Structural Induction
- Week 5: Hoare Logic I – Partial Correctness
- Week 6: Hoare Logic II – Total Correctness
- Week 7: Deterministic Finite Automata (DFAs)
- Week 8: Nondeterministic Finite Automata (NFAs)
- Week 9: Grammars and Pushdown Automata (PDAs)
- Week 10: Turing Machines (TMs)
- Week 11: Decidability
- Week 12: Complexity
Lecture slides can be found on the Wattle page.
Worked examples:#
(Video recordings on YouTube)
- Week 1: 01 Boolean Logic
- Week 2: 02 Propositional Natural Deduction
- Week 3: 03 First Order Natural Deduction
- Week 4: 04 Induction
- Week 5: 05 Hoare Logic and 06 Intro to Hoare Logic
- Week 6: 07 Hoare Logic with Loops + Total Correctness
- Week 7: 08 Finite State Automata
- Week 8: same as week 7
- Week 9: 09 CFLs and Grammars
- Week 10: 10 Turing Machines
- Week 11: 11 Computability
- Week 12: same as above
You may also visit the course’s YouTube channel to check out other useful videos!