Discrete math and algorithms

Some past exams in Bulgarian could be found here.
Languages, automata, and computability

Some past exams in Bulgarian could be found here.
Model theory

The course is part of the Master of Science Program Logic and Algorithms in Faculty of Mathematics and Informatics.
The teaching is joint with Prof. Tinko Tinchev.

Past Courses

Graduate courses: | Computability Theory | Computability and Complexity | |||||

Undergraduate courses: | Mathematical Logic | Logical Programming | Theory of Programs | Semantics of Programming Languages | Discrete structures 1 | Discrete structures 2 | Mathematical Foundations of Computer Science |