Topics in Modal Logic: Contents of classes

Contents of past lectures:

• Dec 12 (tutorial): here is an exercise sheet.
• Dec 12: expressive completeness; course wrap-up
  Material: section 12.3.
• Dec 11: simulation theorem; MSO-automata
  Material: section 10.5; sections 12.1, 12.2.
• Dec 05 (tutorial): here is an exercise sheet.
• Dec 05: automata for one-step logics; simulation theorem
  Material: sections 10.4, 10.5.
• Dec 04: disjunctive modal automata; finite model property; uniform interpolation
  Material: section 10.3; sections 11.1, 11.3.
• Nov 28: modal automata; cover modality and disjunctive modal formulas.
  Material: section 1.7; sections 10.1 -- 10.3.
• Nov 28 (tutorial):
  There will be no tutorial on Nov 28, but here are two exercises anyway: (1) Prove Proposition 6.14. (2) Prove the equivalence of the fast and the slow acceptance game for modal automata, see Remark 10.10.
• Nov 27: positional determinacy of parity games; parity formulas.
  Material: section 5.4; section 6.1, 6.2, 6.3.
• Nov 21: determinisation of stream automata; infinite games.
  Course material: section 4.4; sections 5.1--5.3. Here is an example of the Safra construction.
• Nov 21 (tutorial): exercises 4.10, 5.1 and 5.3.
• Nov 20: stream automata: parity condision, nondeterminism;
  Material: section 4.3, 4.4.
• Nov 14: stream automata.
  Material: section 4.1, 4.2, 4.3.
• Nov 14 (tutorial):
  Exercise 4.4, 4.8; prove Theorem 3.32.
• Nov 13: adequacy; bisimulation invariance; definability of negation
  Material: section 2.4, 3.4, 3.5.
• Nov 07 (tutorial):
  Exercises: 3.2, 3.3 and 2.9.
• Nov 07: traces, the closure map and the closure game
  Material: section 2.5.
• Nov 06: fixpoint theory; algebraic semantics of muML.
  Material: section 3.1, 3.2, 3.4.
• Oct 31 (tutorial):
  Exercises 2.6(c) and 2.7; prove Theorem 1.27.
• Oct 31: syntax and game semantics of muML
  Material: section 2.2, 2.3.
• Oct 30: introduction; syntax and game semantics of ML and muML.
  Material: section 1.1, 1.2, 2.1, 2.2.