Additional material:
H. van Ditmarsch. Het zeven-kaartenprobleem. Nieuw Archief voor Wiskunde, No. 4, dec. 2002, p. 326-332.

The course consists of two parts. Part 1 (Modal Logic) presents the modal logic background and is given by Lev Beklemishev. Part 2 (Epistemic Logic) presents the applications and is given by Jan Broersen. We support two different pages for Parts 1 and 2.

This is the course page for Part 1 (Nov. 17 - Dec. 22). There are four workgroups, the WG begeleiders are Sander Bruggink, Tom Kemper (CKI), Geert Jonker and Ron de Bruin (Informatica). See the pages below for the more detailed information.

• The first overview lecture is given 22.11.04 by Jan Broersen.
• First lecture by Lev Beklemishev: Wo, 24.11.04.
• Monday 29.11: lecture and WG cancelled. 29.11 Lev Beklemishev will give an introductory lecture at OzsL schoolweek "The many faces of provability" where he will speak about various notions of proof occurring in mathematics, computer science, criptography, and real life. Students of the course "Logica voor AI" are cordially invited. The lecture begins at 10:00 am at Hotel Dennenhoeve in Nunspeet.
• First WG: diensdag, 30.11.
• Huiswerkopgaven contribute 10% of the note for Part I of the course. They should be submitted during the first workgroup of the week (Monday), not later than 9:15 am. Submission per e-mail is also possible (pdf format is encouraged), provided it is earlier than this deadline. Please, submit the homework to your WG supervisor, not to Lev.
• Laatste WG: Maandag 20.01.
• Tentamen deel 1: Maandag, 3.01.05, 11:00-13:00 (twee uur lang), Educatorium, Alpha. Gesloten boek.
• Eerste HC, deel 2: maandag 10.01.
• Tentamenopgaven, 2003: .pdf
• Tentamencijfers, deel 1 (inclusief herkansingcijfers)

Problem set 1: .ps, .pdf

Uitwerking door Sander Bruggink:   .pdf

Uitwerking inleveropgave door Sander Bruggink:   .pdf

Problem set 2: .ps, .pdf

Uitwerking door Sander Bruggink:   .pdf

Problem set 3: Page 1: .ps, .pdf   Page 2: .ps, .pdf

Uitwerking (Problem set 3)   .pdf

Note: Reduced models for S5 are explained on Page 28 of the book.

Uitwerking huiswerkopgaven (week 2&3)   .pdf

Problem set 4: .pdf  

Part 1. Modal logic

• Kripke completeness of modal logics, finite model property. P.17
• Consistent and maximal consistent sets of formulas. Their properties. P.14-17
• Canonical model construction. Canonical model lemma.  P.19-22, Lemma 1.4.8
• Proof of the completeness theorem for K.  P.18,  Theorem 1.4.7
• Properties of the canonical models for logics K4, T, S4, S5. Completeness theorems. P. 26-27  
• Reduced models for S5. P. 28
• Finite model property. Filtration.  P.51-52
• Proofs of  finite model property for K, K4, S4, T, S5.
• Bisimulations. P.30-31.
• The Muddy Children puzzle.

Part 2. Epistemic logic
(see course page for Part II.)