Infopaket

Algorithm Theory and Mathematical Logic

ОК.29

Обов’язкова дисципліна для ОП

First

2023/2024

4 Semester

4

LO2. Be able to recognize standard schemes for solving combinatorial and logical problems formulated in natural language; apply classical algorithms for checking the properties and classification of objects, sets, relations, graphs, groups, rings, lattices, Boolean functions, etc. LO15. Understand Ukrainian and foreign languages at a level sufficient for processing professional informational and literary sources, professional oral and written communication, writing texts on professional topics.

Distance form

Know: basic concepts of discrete mathematics: basics of set theory, relations theory, Boolean function theory. Be able to: establish basic set-theoretic relations, use the apparatus of Boolean function theory.

The goal of the discipline is to acquire basic knowledge of the basics of mathematical logic and the theory of algorithms, including the study of semantic models and formal languages of logic, the study of formal-axiomatic logical systems and proof search systems, the study of formal models of algorithms and algorithmically computable functions, issues of computability, decidability and insolvability of mass problems. The educational discipline "Theory of Algorithms and Mathematical Logic" is a component of the educational and professional training program for specialists at the first (bachelor) level of higher education in the field of knowledge No. 12 "Information Technologies" from the specialty No. 124 "System Analysis" of the educational and professional program "System Analysis". This discipline is a mandatory study under the "System Analysis" program. It is taught in the 4th semester of the 2nd course in the amount of 120 hours. (4 ECTS credits), in particular: lectures – 30 hours, practical classes – 30 hours, independent work – 60 hours. The course includes 4 tests. The discipline ends with a credit in the 4th semester.

1. Nikitchenko M.S., Shkilniak S.S. Mathematical logic and theory of algorithms. - K., 2008. 2. Trokhimchuk R.M., Nikitchenko M.S. Discrete mathematics in examples and problems. Kyiv. nat. Univ. Taras Shevchenko. - Kyiv: Kyiv University, 2017. - 248 p. 3. Zubenko V.V., Shkilniak S.S. Fundamentals of mathematical logic: a textbook. K .: NUBiP of Ukraine, 2020.– 102 p.

Lecture, practical classes, independent work. Tests 1 – 4, current evaluation.

Semester assessment: 1. Test 1: LO 1.1, LO 2.2 – 20 points / 12 points. 2. Test 2: LO 1.1, LO 2.1 – 20 points / 12 points. 3. Test 3: LO 1.2, LO 1.3, LO 2.2 – 20 points / 12 points. 4. Test 4 (questions from the lecture course): LO 1.1 - LO 1.3 - 20 points / 12 points. 5. Students' work in practical classes (current evaluation): РН2.2, РН3.1 – 20 points/ 12 points. Final assessment is in the form of credit. It is awarded based on the results of students' work throughout the semester and does not provide for additional assessment measures for successful students.

Ukrainian