CS 245E
Logic and Computation (Enriched)
Fall 2026
Topics
- Propositional logic and normal forms
- Digital circuits and finite-state machines
- Temporal logic
- Deduction, soundness and completeness
- Lean and automated reasoning
- Resolution and satisfiability
- First-order logic
- Unification, SMT and Prolog
- Arithmetic theories
- Computability and undecidability
- Gödel incompleteness
- Hoare logic and program verification
Readings
- Mathematical Logic for Computer Science
Sources
- Course catalogue ↗2026–2027
- course_website ↗Fall 2026