Logic in Informatics

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Mathematics

Synopsis:

Matematical logic, finite model theory, constraint satisfaction problems, modal logics, dynamic logics, intuitionism.

Requirements:

Previous basic knowledge of mathematical logic is recommended for the course.

Syllabus of lectures:

The course will be composed by blocks taught by different lecturers (possibly partly in English) who are active researchers in their respective fields:

1.Classical propositional and predicate logic as a modelling tool. Finite model theory. Constraint satisfaction problems.

2.Modal logics and their applications in computer science.

3.Dynamic logics and formal verificiation of programs.

4.Intuitionism and constructivism.

Syllabus of tutorials:

Study Objective:

Acquired knowledge:

Basic notions and results of classical and non-classical logics and their role in computer science.

Acquired skills:

Ability to apply results of mathematical logic to computer science.

Study materials:

Compulsory literature:

[1] Mordechai Ben-Ari. Mathematical Logic for Computer Science. Springer, 2012.

Optional literature:

[1] Johan van Benthem, Patrick Blackburn (eds.). Handbook of Modal Logic. Elsevier, 2006.

[2] David Harel, Dexter Kozen, Jerzy Tiuryn. Dynamic logic. MIT Press, 2000.

[3] Leonid Libkin. Elements of Finite Model Theory. Springer, 2004.

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: