COMP 409: Lecture Notes

  • Preliminaries
  • Formulas and Circuits (Adequacy)
  • Lecture 0 (Introduction to Logic in CS)
  • Lecture 1 (The Formulas of Propositional Logic)
  • Lecture 2 (Parsing Propositional Formulas)
  • Lecture 3 (Semantics of Propositional Logic)
  • Lecture 4 (More Semantics)
  • Lecture 5 (Introduction to Complexity Theory)
  • Lecture 6 (Classification of Formulas)
  • Lecture 7 (The Satisfiability Problem)
  • Lecture 8 (NP Completeness)
  • Lecture 9 (The Splitting Method for SAT)
  • Lecture 11 (Deductions)
  • Lecture 12 (Deduction and Resolution)
  • Lecture 13 (Proof Complexity)
  • Lecture 14 (First-Order Logic)
  • Lecture 15 (Semantics of First-Order Logic)
  • Lecture 16 (Relevance Lemma and Relational Databases)
  • Lecture 17 (Relational Queries)
  • Lecture 18 (The Logic of Circuits - I)
  • Lecture 19 (The Logic of Circuits - II)
  • Lecture 20 (Expressiveness of FOL - I)
  • Lecture 21 (Expressiveness of FOL - II)
  • Lecture 22 (Expressiveness of FOL - III)
  • Lecture 23 (The Compactness Theorem)
  • Lecture 24 (Truth and Complexity, I)
  • Lecture 25 (Truth and Complexity, II)
  • Lecture 26 (Truth and Complexity, III)