Mathematical Logic and Algorithm Theory
Course: Applied Mathematics
Structural unit: Faculty of Computer Science and Cybernetics
Title
Mathematical Logic and Algorithm Theory
Code
ДВС.3.01.01
Module type
Вибіркова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2023/2024
Semester/trimester when the component is delivered
4 Semester
Number of ECTS credits allocated
5
Learning outcomes
LO 4. Be able to describe and analyze discrete objects and systems, using the concepts and methods of discrete mathematics, algorithm theory and mathematical logic.
LO 8. Develop discrete and continuous mathematical models.
Form of study
Distance form
Prerequisites and co-requisites
Know: Be able to recognize standard schemes for solving combinatorial and logical problems formulated in natural language; apply
classic algorithms for checking properties and classifying objects
Be able to: write formal statements, establish truth, feasibility, prove the existence of a logical consequence.
Course content
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 " Mathematical Logic and Algorithms Theory " 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. 11 "Mathematics and Statistics" from the specialty 113 "Applied Mathematics", educational and professional program "Applied Mathematics".This discipline is a mandatory study under the " Applied Mathematics " program.
It is taught in the 4th semester of the 2nd course in the amount of 150 hours. (5 ECTS credits), in particular:
lectures – 42 hours, practical classes – 32 hours, consultations – 2 hours, independent work – 74 hours. The course includes3 tests. The discipline ends with with an exam in the 4th semester.
Recommended or required reading and other learning resources/tools
1. Nikitchenko M.S., Shkilniak S.S. Applied logic. - K., 2008.
2. Nikitchenko M.S., Shkilniak S.S. Mathematical logic and theory of algorithms. - K., 2008.
3. Mendelson E. Introduction to mathematical logic. - M., 1976.
4. Shenfield J. Mathematical logic. - M., 1975.
5. Shkilniak S.S. Mathematical logic: examples and problems. - K., 2007.
Planned learning activities and teaching methods
Lectures, лабораторні роботи, independent work.
Assessment methods and criteria
Semester assessment:
1. Test 1: LO 1.1, LO 1.2 LO 1.3 – 30 points
2. Test 2: LO 2.1 – 10 points
3. Test 3: LO 2.2 – 10 points
4. Students' work in practical classes (current evaluation) РН3.1 – 10 points
Final assessment is an exam:
- maximum number of points: 40
- number of points 1.- 3.
- form of conduct: written.
Language of instruction
Ukrainian
Lecturers
This discipline is taught by the following teachers
Vitalii
V.
Zubenko
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