- lecture 1: language and models of basic modal logic; possible interpretations of models, e.g. states in a computation; applications of modal logic; overview of systems
- lecture 2: completeness, finite model property and decidability proof for basic modal logic
- lecture 3: bisimulation; preservation of modal formulas under bisimulation; similarities with process algebra; propositional dynamic logic (PDL)
- lecture 4: computational tree logic (CTL); model-checking

Slides of lecture 1 (pdf)

Slides of lecture 2 (pdf)

Slides of lecture 3 (pdf)

Slides of lecture 4 (pdf)

Exercises, exam questions, recommended reading (2003)