Formal Logic

Where und When:

Here the link to the ekvv-entry.

Latest News: Written exam on Thursday 15th February 2018 from 10-12 in Lecture Hall 2.
How to prepare? Have a look at all exercises except 1,8,19,20,32,33,35-38. Have in mind that you may have more powerful tools at hand now than when these exercises have been given! E.g. 43 and 44 can now be solved using the tableau calculus of modal logic. Use also Schöning or Kreuzer-Kühling where you find more exercises of this type, or find similar ones online.


Formal logic appears naturally in several places in computer science. Logic gates are the elementary building blocks of integrated circuits. Proofs of NP-hardness often use reductions to satisfiability of Boolean expressions. Logic provides a concept of computability, and a wealth of problems that cannot be solved algorithmically. Propositional and first-order logic, as well as temporal logic and higher-order logic are used in the verification and validation of computer algorithms.

This one-semester lecture offers introduction to advanced topics of formal logic. After setting the ground by delving into propositional logic, this course covers first-order logic, modal logic, temporal logic (with some focus on normal forms and the algorithmic treatment of logic formula) as well as concepts and questions about (un-)decidabilty.

The 2h lectures are accompanied by problem sheets. Solutions to the problem sheets will be handed in by the students and discussed in the problem class. 5 credit points are obtained by solving more than 50% of the problems on the problem sheets plus passing the written exam at the end of the course.

Exercise Sheets

Lecture notes

The lecture notes, updated each week.


Last change 29.1.2018       Dirk Frettlöh