Course Description

• This course presents the basic problems in Set theory, Mathematical logic and the Theory of algorithms. It covers major classical topics in proof theory and the semantics of propositional and predicate logic as well as set theory and computation theory. In Theory of algorithms, Markov algorithm and Turing machines are in focus. Most of the exercises are followed by solutions or hints, which are given in each section of the course.


• Topics of practical training are Basics of Set theory, Basics of propositional logic, Basics of predicate logic, Logical consequence and resolution method, Markov algorithm and Turing machines.


• This course is assigned to students of bachelor degree programme: Computer science and engineering (09.03.01)

Contact hours: 64
Private study hours: 44
Total study time: 108 hours
Credits: 3