Course teacher(s)
Emmanuel FILIOT (Coordinator)ECTS credits
5
Language(s) of instruction
french
Course content
-propositinoal logic (syntax, semantics, tableau algorithm, natural deduction, resolution) -first order logic ((syntax, semantics, tableaux, natural deduction, resolution) -Goedel's completness theorem -Goedel's incompletness theorem
Objectives (and/or specific learning outcomes)
Give an overview of classical logics useful in computer science. Show the limits of what can be formalized using formal languages.
Prerequisites and Corequisites
Cours co-requis
Cours ayant celui-ci comme co-requis
Teaching methods and learning activities
Classical theory lectures with excercices. Realization of a small project where students have to solve a problem using a tool for solving satisfiability of propositional formulas (sat solver).
References, bibliography, and recommended reading
-Mathematical logic for computer science, Ben-Ari, Springer. -Slides given by the teacher
Evaluation
Method(s) of evaluation
- Oral examination
Oral examination
Oral exam.