Algorithm theory and mathematical logic
Course: System Analysis
Structural unit: Faculty of Computer Science and Cybernetics
Title
Algorithm theory and mathematical logic
Code
Module type
Обов’язкова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2021/2022
Semester/trimester when the component is delivered
4 Semester
Number of ECTS credits allocated
4
Learning outcomes
Know the basic concepts, tools and methods of mathematical logic, their application in information technology and systems analysis, know the languages of propositional logic and logic of the 1st order, their ability to describe subject areas.
Know the basic methods of finding proofs and means of logical inference: the method of resolutions, Hilbert and Henzen type calculations).
Know the basic formal models of algorithms and computational functions, their properties, Church's thesis, know coding and numbering, universal functions and programs.
Be able to derive in propositional calculus and in prime-order calculus of the Henzen type.
Justify your own view on the problem and how to solve it, communicate with colleagues on the application of mathematical logic and algorithm theory.
Form of study
Prerequisites and co-requisites
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.
Course content
The discipline "Algorithm Theory and Mathematical Logic" is a component of the educational-professional training program for the first (bachelor's) level of higher education in the field of knowledge №12 "Information Technology" in the specialty №124 "System Analysis" of the educational-professional program "System Analysis".
This discipline is a compulsory curriculum for the program "Systems Analysis"
It is taught in the 4th semester of the 2nd year 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 test in the 4th semester.
Recommended or required reading and other learning resources/tools
1. Nikitchenko MS, Shkilnyak SS Mathematical logic and theory of algorithms. - K., 2008.
2. Trokhimchuk RM, Nikitchenko MS Discrete mathematics in examples and problems. Kyiv. nat. Univ. Taras Shevchenko. - Kyiv: Kyiv University, 2017. - 248 p.
3. Zubenko VV, Shkilnyak SS Fundamentals of mathematical logic: a textbook. K .: NULES of Ukraine, 2020.– 102 p.
Planned learning activities and teaching methods
Lecture, practical classes, independent work
Assessment methods and criteria
Test work, credit
Language of instruction
Ukrainian
Lecturers
This discipline is taught by the following teachers
Mykola
S.
Nikitchenko
Theory and Technology of Programming
Faculty of Computer Science and Cybernetics
Faculty of Computer Science and Cybernetics
Departments
The following departments are involved in teaching the above discipline
Theory and Technology of Programming
Faculty of Computer Science and Cybernetics