COMP 409: Lecture Notes

  • Preliminaries
  • Formulas and Circuits (Adequacy)
  • Lecture 0 (And Logic Begat Computer Science) - Aug. 21, 2012
  • Lecture 1 (The Formulas of Propositional Logic) - Aug. 23, 2012
  • Lecture 2 (Parsing Propositional Formulas) - Aug. 25, 2012
  • Lecture 3 (Semantics of Propositional Logic) - Aug. 28, 2012
  • Lecture 4 (More Semantics) - Sept. 4, 2012
  • Lecture 5 (Introduction to Complexity Theory) - Sept. 6, 2012
  • Lecture 6 (Classification of Formulas) - Sept. 11, 2012
  • Lecture 7 (The Satisfiability Problem) - Sept. 13, 2012
  • Lecture 8 (NP Completeness) - Sept. 20, 2012
  • Lecture 9 (The Splitting Method for SAT) - Sept. 25 2012
  • Lecture 10 (Automata for SAT) - Sept. 27, 2012
  • Lecture 11 (Proof and Deductions) - Oct. 2, 2012
  • Lecture 12 (Deduction and Resolution) - Oct. 4 ,2012
  • Lecture 13 (Proof Complexity) - Oct. 9, 2012
  • Lecture 14 (First-Order Logic) - Oct. 16, 2012
  • Lecture 15 (First-Order Logic) - Oct. 18, 2012
  • Lecture 16 (Relevance Lemma, Relational Databases) - Oct. 23, 2012
  • Lecture 17 (Relational Query Evaluation) - Oct. 25, 2012
  • Lecture 18 (Reachbility, Transducers, and Circuits) - Oct. 30, 2012
  • Lecture 19 (Circuits, Traces, and Properties) - Nov. 1, 2012
  • Lecture 20 (Homomorphisms, Isomorphisms, and Expressiveness) - Nov. 6, 2012
  • Lecture 21 (Elementary Equivalence and Definability) - Nov. 8, 2012
  • Lecture 22 (EC and EC_Delta) - Nov. 13, 2012
  • Lecture 23 (Compactness and Definability) - Nov. 15, 2012
  • Lecture 24 (Decision Problems and Undecidability) - Nov. 20, 2012
  • Lecture 25 (Satisfiability and Normalization) - Nov. 27, 2012
  • Lecture 26 (Semidecidability) - Nov. 29, 2012