Logic in Computer Science — LP1 2011/2012


Goals of the course

The goal of the course is to present the fundamental basic notions of logic that are important in computer science. One presents propositional and predicate logic in natural deductions the way it is done in most interactive theorem provers, with a suggestive box notations for proofs. One presents also the basis of model checking and temporal logic (LTL and CTL). One does not cover a detailed proof of completeness theorem for predicate logic (and one gives a sktech of completeness for propositional logic) but what is important is that the students understand well the -meaning- of the various completeness theorems. (On the other hand one gives a proof of undecidability of predicate logic via Post systems.) In the same spirit, one does not present complete proofs of decidability for LTL and CTL but one presents in detail the fixed-point semantics of CTL.

The content of the course is roughly the 3 first chapters of Huth and Ryan "Logic in Computer Science".

There are some slides motivating the course.

Text Book

This course use Logic in Computer Science by Michael Huth and Mark Ryan.


Otherwise Tuesday 13.15 - 15:00 in HC1 and Wednesday 10:00 - 11:45 in HC2.
Exercice Sessions
Friday 10:00-11:45 in HC2.

Plan for the lectures

Week Tuesday Wednesday Chapters Topics Exercises
1 30 Aug 31 Aug 1.1, 1.2 Propositional logic, natural deduction Week 1
2 6 sep 7 sep 1.3, 1.4, 1.5 formal language, proof by induction, semantics, normal form Week 2
3 13 sep 14 sep 2.1, 2.2 Predicate logic as a formal language Week 3
4 20 sep 21 sep 2.3,2.4 Semantics of predicate logic Week 4
5 27 sep 28 sep 2.5, 2.6, 3.1, 3.2 Undecidability, expressivity of predicate logic; Model checking Week 5
6 4 oct 5 oct 3.3, 3.4, 3.5, 3.6 LTL, CTL Week 6
7 11 oct 12 oct 3.7 Algorithms, fixed-point characterisation, repetition Week 7


No books or written help during the exam.


Here is a list of exercices from a previous year, some with comments. Since time is short there are no guarentees that all exercises will be covered during the exercise session on Fridays. Exercises marked with a * in the text book have solutions.

Interesting links


Feel free to contact Jan Smith, Thierry Coquand or/and Simon Huber in case you have any questions or problems. Almost everything you get in the class is available electronically. Send me a request if you have missed some stuff.