Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Logic 2014

  News | Dates | Grading | Content | Exercises | Exam | Slides | Literature | Software

These are the slides for the course.

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.

  • Organization and introduction [PDF]
  • (Sch) Propositional logic: basic notions [PDF]
  • (Sch) Equivalence and normal forms [PDF]
  • (Sch) Horn formulas [PDF]
  • (Sch) Resolution [PDF]
  • Davis-Putnam-Loveland-Logemann [PDF]
  • Binary Decision Diagrams [PDF]
  • (Sch) Compactness Theorem for propositional logic [PDF]
  • (Sch) Introduction to predicate logic [PDF]
  • (Sch) Normal forms for predicate logic [PDF]
  • (Sch) Completeness [PDF]
  • Predicate logic with equality [PDF]
  • (Sch) Resolution for predicate logic [PDF]
  • (Sch) Restrictions of resolution [PDF]
  • Undecidability [PDF]
  • Mathematical theories and decision procedures [PDF]
  • Hilbert calculus [PDF]
  • Gödel's Incompleteness Theorems [PDF]
  • Expressibility in predicate logic [PDF]
  • Van Benthem-Rosen Characterization Theorem [PDF]
19:19, June 25, 2014