Topics in Modal Logic (Fall 2018)
This page concerns the course `Topics in Modal Logic', taught at the University
of Amsterdam from October - December 2018.
(This course used to be called `Capita Selecta in Modal Logic, Algebra and
Contents of these pages
- On Wednesday 19 December (14:00 - 16:00) there will be a question hour
in room F0.22 (ILLC building).
During this meeting I will answer questions about the course content, and/or
discuss solutions to the exercises in the homework sets 4-6.
- New updates of the lecture notes are available:
- The sixth homework set is available. Deadline for submission is
Monday 17 December 17h00.
Collection and submission proceeds via Canvas (but you can find the
homework also here).
- We will make use of lecture notes, to be provided (and updated if needed)
during the course.
Here are the most recent versions of the notes:
- Here is the version of the notes of 2016.
Note: all references on this website will be to the new version of the lecture
- Lecturer: Yde Venema (y dot venema at uva dot nl, phone: 525 5299)
Dates & location:
Classes run from 31 October until 14 December; there will be 14 classes
There are two classes weekly, on Wednesdays from 09.00 - 10.45, in
room (ILLC) F2.19 and on Fridays from 09.00 - 10.45 in room SP G2.13.
There is an exam on Thursday December 20, from 09.00 - 12.00, in room SP A1.04.
- All of these rooms are in the Science Park.
Grading is primarily through homework assignments, and a written exam at the
end of the course.
For the later part of the course additional/alternative requirements may apply
(such as working out lecture notes).
See the separate page on grading for more details.
Modal languages are simple yet expressive and flexible tools for describing
all kinds of relational structures.
Thus modal logic finds applications in many disciplines such as computer
science, mathematics, linguistics or economics.
Notwithstanding this enormous diversity in appearance and application area,
modal logics have a great number of properties in common.
This common mathematical backbone form the content of this course, the exact
topics change from year to year.
This year, the course will be devoted entirely to connections between modal
fixpoint logic and automata theory.
This is a classic field in theoretical computer science, which has led to
both seminal theoretical results such as Rabin's decidability theorem, and
practical applications in the field of specification and verification of
More specifically, a large part of the course will focus on the modal
mu-calculus, an extension of modal logic with explicit fixpoint operators, which
was introduced in the early 1980s.
The modal mu-calculus shares many attractive properties with ordinary modal
logic, but has a much bigger expressive power.
A main theme of the course will be the use of automata-theoretic tools to
understand and prove results about the modal mu-calculus.
Indicatively, we will discuss the following topics:
- modal mu-calculus: syntax and semantics
- equivalence of game-theoretical and algebraic semantics
- algebraic theory of fixpoint operators
- bisimulation invariance and bounded tree model property
- size matters in the modal mu-calculus
- automata for infinite words: basic definitions, acceptance conditions,
- theory of infinite games
- parity games: positional determinacy, complexity issues
- cyclic formulas and modal automata
- simulation theorem
- finite model property, complexity of the satisfiability problem
- uniform interpolation
- expressive completeness
We presuppose some (but very little) basic background knowledge
on modal logic; roughly, what is needed is familiarity with the syntax and
semantics of modal languages, and the notion of bisimulation.
More precisely, we build on the basic material covered
in the course Introduction to Modal Logic, that is: the sections
1.1-1.3, 2.1-2.3 of the Modal Logic book.
Next to this, we assume that students possess some mathematical maturity.
Comments, complaints, questions: mail