Logic 2011

These are the slides for the course. The files labelled with "PDF-4" contain four slides per page.

It may be a good idea to print a copy of the slides, bring it with you to the classroom, and make notes on the slides as you follow the lecture.

(Sch) means that the set of slides is based on the book by Uwe Schöning. In this case most slides just show definitions and results from the book.

• Introduction [PDF] [PDF-4]
• (Sch) Propositional logic: basic notions [PDF] [PDF-4]
• (Sch) Equivalence and normal forms [PDF] [PDF-4]
• Modelling digital circuits [PDF] [PDF-4]
• (Sch) Horn formulas [PDF] [PDF-4]
• (Sch) Resolution [PDF] [PDF-4]
• Davis-Putnam-Loveland-Logemann [PDF] [PDF-4]
  • Correctness proof for the One-Literal Rule.
  • Slide on two-watched literals
• Binary Decision Diagrams [PDF] [PDF-4] [With annotations]
• (Sch) Compactness theorem [PDF] [PDF-4]
• (Sch) Predicate logic [PDF] [PDF-4]
• (Sch) Normal forms [PDF] [PDF-4]
• Predicate logic with equality [PDF] [PDF-4]
• (Sch) Completeness [PDF] [PDF-4]
• (Sch) Resolution for predicate logic [PDF] [PDF-4]
• (Sch) Restrictions of resolution [PDF] [PDF-4]
• (Sch) Prolog [PDF] [PDF-4]
• Databases and relational algebra [PDF] [PDF-4]
• Undecidability [PDF] [PDF-4]
• Mathematical theories and decision procedures [PDF] [PDF-4]
• Hilbert Calculus [PDF] [PDF-4]
• Gödel's theorems [PDF] [PDF-4]