Algemene informatie
| Vakcode | X_401015 |
|---|---|
| Studiepunten | 6 EC |
| Periode | P5 |
| Vakniveau | 200 |
| Onderwijstaal | Engels |
| Faculteit | Faculteit der Bètawetenschappen |
| Vakcoördinator | T. Baanen |
| Examinator | T. Baanen |
| Docenten |
dr. J.C. Blanchette T. Baanen |
|
Onderdeel van opleiding(en)
Premaster
Gebruik pijltjestoetsen om door de lijst te navigeren, Enter om te selecteren, en Escape om te sluiten.
|
|
Praktische informatie
Voor dit vak moet je zelf intekenen. De inteken- en afmeldtermijnen staan op VU.nl
| Onderwijsvorm | Werkcollege, Practicum, Deeltentamen schriftelijk, Hoorcollege |
|---|
Doelgroepen
Dit vak is ook toegankelijk als:
Dit vak wordt in het Engels aangeboden. Omschrijvingen kunnen daardoor mogelijk alleen in het Engels worden weergegeven.
Doel vak
The course objective is to obtain a good knowledge and understanding ofthe most important logical systems: propositional logic, predicate
logic, and modal logic. (Knowledge and understanding)
The students learn to use these systems to model data, knowledge, and
actions. (Applying knowledge and understanding)
An important aspect of the course is the ability to reason using these
logics and reason about these logics: what can and what can not be
expressed with a logic system, and what are the differences between the
systems with respect to expressive power or the existence of decision
procedures. (Applying knowledge and understanding) (Making judgements)
Inhoud vak
The focus of the lecture is on propositional logic and first-orderpredicate logic. We work with natural deduction as a proof system. The
relation between semantic and syntactic methods is important; the
central keywords are correctness, consistency, and completeness.
Moreover, we pay attention to expressive power, for example when
formulating queries. A fundamental tool, for this purpose, is the
compactness theorem.
Algorithmically there is the contrast between the decidability of
propositional logic and the undecidability of predicate logic (for
example, seen by a coding of the Post Correspondence Problem).
As a variation of the mentioned logics, we consider modal logic with
Kripke models as semantics.
Aanvullende informatie onderwijsvormen
Lecture (2 * 90 hours per week)Exercise classes (2 * 90 hours per week)
Computer practicum using the Lean proof assistant, done during exercise
classes.
Toetsvorm
Final exam (100%) and computer assignments using the Lean proofassistant (required to qualify for the exam, and 0.5 bonus points for
doing extra problems).
Literatuur
Mandatory literature:Jeremy Avigad, Robert Y. Lewis, Floris van Doorn, Logic and Proof
https://avigad.github.io/logic_and_proof/
Michael Huth, Mark Ryan, Logic in Computer Science (2nd edition)
Cambridge University Press, 2004 ISBN 0 521 54310 X
Aanvullende informatie doelgroep
Bachelor Computer Science (year 1)Bachelor Econometrics and Operations Research (year 3)