6 EC
Semester 1, periode 1, 2
5122INML6Y
Het vak behandelt de basisbegrippen van de modale logica: syntax, relationele semantiek, modellen en frames, bisimulaties, model- en frametheoretische constructies, volledigheid.
The course covers the basic notions of modal logic: syntax, relational semantics, models and frames, bisimulations, model theoretic and frame theoretic constructions, completeness. More advanced topics include expressive power and neighbourhood frames.
The students should be able to point out when a modal formula is satisfied/valid on a given Kripke model/frame.
They should also be able to compute standard translations of modal formulas and first-order correspondents of Sahlqvist formulas.
They are expected to produce a completeness proof via the canonical model construction for some basic systems of modal logic.
They should also be able to derive finite model property of such systems via the method of filtration.
Students should be able to argue about decidability of simple systems of modal logic by combining finite axiomatization and the finite model property of these systems.
Students are also expected to solve basic problems involving more complex modal systems such as PDL.
Hoorcollege en werkcollege.
Lectures and tutorials.
|
Activiteit |
Aantal uur |
|
Hoorcollege |
28 |
|
Tentamen |
3 |
|
Tussentoets |
2 |
|
Werkcollege |
28 |
|
Zelfstudie |
83 |
Aanwezigheidseisen opleiding (OER-B):
Aanvullende eisen voor dit vak:
| Onderdeel en weging | Details |
|
Eindcijfer | |
|
1 (50%) Homework | |
|
1 (50%) Tentamen |
There will be 6 Homework sheets. There will be a midterm exam and also a final exam. The final grade consists 50% of the homework grade, 10% of the grade of the midterm exam and 40% of the grade of the final exam. The homework grade is split into 6 homework sheets weighing 100 points each.
Dit vak hanteert de algemene 'Fraude- en plagiaatregeling' van de UvA. Hier wordt nauwkeurig op gecontroleerd. Bij verdenking van fraude of plagiaat wordt de examencommissie van de opleiding ingeschakeld. Zie de Fraude- en plagiaatregeling van de UvA: www.uva.nl/plagiaat
| Weeknummer | Onderwerpen | Studiestof |
| 1 | Syntax, relational semantics | Sections 1.1 - 1.3 |
| 2 | Models and frames, bisimulations | Sections 2.1 - 2.2 |
| 3 | Filtrations | Section 2.3 |
| 4 | Standard translation, van Benthem's bisimulation characterisation theorem | Sections 2.4 & 2.6 |
| 5 | First-order correspondence | Sections3.1-3.2 and 3.5 |
| 6 | Sahlqvist algorithm | Section 3.6 |
| 7 | Sahlqvist algorithm: Examples | Section 3.6 |
| 8 | Norrmal modal logics, soundness | Sections 1.6 & 4.2 |
| 9 | Completeness via canonical models I | Section 4.2 |
| 10 | Completeness via canonical models II | Section 4.2 |
| 11 | Finite model property and decidability | Section 4.3 and 6.2 |
| 12 | General frames, incomplete logics | Section 4.4 |
| 13 | Propositional Dynamic Logic PDL: semantics | Section 4.8 |
| 14 | Propositional Dynamic Logic PDL: completeness | Section 4.8 |
| 15 | N/A | |
| 16 | N/A |
Het rooster van dit vak is in te zien op DataNose.
Op dit vak is geen honoursuitbreiding mogelijk.
Aanbevolen voorkennis: Kennis van de eerste orde logica (syntax en semantiek), en elementaire wiskundige kennis en vaardigheden.
Recommended prior knowledge: Knowledge of first order logic (syntax and semantics) and elementary mathematical knowledge and skills.
Instructors: Nick Bezhanishvili and Yde Venema, emails: N.Bezhanishvili[at]uva.nl and Y.Venema[at]uva.nl
Teaching assistants: Frederik Lauridsen , email: F.M.Lauridsen[at]uva.nl ; Gianluca Grilleti, email: grilletti.gianluca[at]gmail.com