IA008 Computational Logic

Faculty of Informatics
Spring 2026
Extent and Intensity
2/2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
In-person direct teaching
Teacher(s)
Dr. rer. nat. Achim Blumensath (lecturer)
Guaranteed by
Dr. rer. nat. Achim Blumensath
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 16. 2. to Mon 11. 5. Mon 18:00–19:50 A217
  • Timetable of Seminar Groups:
IA008/01: Thu 19. 2. to Thu 14. 5. Thu 18:00–19:50 C416, A. Blumensath
IA008/02: Thu 19. 2. to Thu 14. 5. Thu 16:00–17:50 C416, A. Blumensath
IA008/03: Wed 18. 2. to Wed 6. 5. Wed 18:00–19:50 A318; and Wed 13. 5. 18:00–19:50 A214, A. Blumensath
Prerequisites
some familiarity with basic notions from logic like: formula, model, satisfaction, logical equivalence.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 111 student(s).
Current registration and enrolment status: enrolled: 59/111, only registered: 0/111, only registered with preference (fields directly associated with the programme): 0/111
fields of study / plans the course is directly associated with
there are 37 fields of study the course is directly associated with, display
Abstract
The course is about algorithmic problems related to logic. The focus is on model checking and satisfiability algorithms for several logics used in the various fields of computer science, for instance in verification or knowledge representation.
Learning outcomes
After successfully completing this course students should be familiar with several logics, including propositional logic, first-order logic, and modal logic. They should be familiar with various proof calculi for these logics and be able to use such calculi to test formulae for satisfiability and/or validity. In addition, they should have basic knowledge about automatic theorem provers and they way these work.
Key topics
  • Resolution for propositional logic.
  • Resolution for first-order logic.
  • Prolog.
  • Fundamentals of database theory.
  • Tableaux proofs for first-oder logic.
  • Natural deduction.
  • Ehrenfeucht-Fraise games.
  • Induction.
  • Modal logic.
  • Many-valued logics.
Study resources and literature
    recommended literature
  • ENDERTON, Herbert B. A mathematical introduction to logic. 2nd ed. San Diego: Harcourt/Academic press, 2001, xii, 317. ISBN 0122384520. info
  • NERODE, Anil and Richard A. SHORE. Logic for applications. New York: Springer-Verlag, 1993, xvii, 365. ISBN 0387941290. info
  • EBBINGHAUS, Heinz-Dieter; Jörg FLUM and Wolfgang THOMAS. Mathematical logic. Third edition. Cham: Springer, 2021, ix, 304. ISBN 9783030738389. info
Approaches, practices, and methods used in teaching
lectures, exercises.
Method of verifying learning outcomes and course completion requirements
A final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2026/IA008