Lecture 01: History of Complexity and Logic
Lecture 02: Review of Computability and Complexity
Lecture 03: Time and Space Complexity
Lecture 04: Complexity Hierarchies and Alternation
Lecture 05: Alternating Space and Time Theorems
Lecture 06: The Immerman-Szelepscenyi Theorem
Lecture 07: Satisfiability and Quantified Boolean Formulas
Lecture 08: Propositional Proof Systems
Lecture 09: Propositional Modal Logic
Lecture 10: K-Satisfiability and Linear Time Logic
Lecture 11: Linear Time Logic
Lecture 12: CTL and First-order Predicate Logic
Lecture 13: The Herbrand Universe Construction
Lecture 14: Consequences of the Herbrand Universe Construction
Lecture 15: Godel's Incompleteness Theorem
Lecture 16: Number Theory and Presburger Arithmetic
Lecture 17: Ehrenfeucht Games and Bounded Quantifiers
Lecture 18: Super-Exponential Complexity of Presburger Arithmetic
Lecture 19: Categoricity and Second Order Predicate Logic
Combined Lectures All 19 lectures combined into
one 83 page document. Contains some references and a table of contents.