Infopaket

Applied and Compositional Logics

ННД.13

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

Second

2023/2024

3 Semester

4

PLO13. To use computer science and information technology and critical thinking skills, analysis and synthesis for professional purposes. PLO14. To apply innovative approaches in computer science and information technology.

Distance form

To know basic concepts of mathematical logic: languages of propositional logic and first-order logic, their capabilities for for describing subject areas; to have a modern understanding of the basic methods for proof search and tools for logical inference. To be able to describe statements regarding specific subject areas in formal languages; perform derivations in propositional and first-order Hilbert-style and sequent-style calculi.

The goal of the discipline is to deepen knowledge in mathematical logic, including the study of proof assistant systems, program-oriented logical formalisms; acquisition of competencies, knowledge, skills, and abilities related to the practical application of mathematical logic in computer science and programming. The educational discipline "Applied and Compositional Logics" is a component of the educational-scientific program "Informatics" of the educational-qualification level "Master" in the field of knowledge 12 "Information Technologies" in the specialty 122 "Computer Science". This discipline is a compulsory course in the "Informatics" program. It is taught in the 3rd semester of the 2nd year of master's studies in the amount of 120 hours (4 ECTS credits), in particular: lectures – 38 hours, consultations – 2 hours, independent work – 80 hours. The course includes 2 Midterm Exams and an essay. The discipline ends with an exam in the 3rd semester.

1. Nikitchenko M.S., Shkilniak S.S. Prykladna lohika. – K., 2013. 2. Nikitchenko M.S., Shkilniak O.S., Shkilniak S.S. Chysti pershoporiadkovi lohiky kvaziarnykh predykativ // Probl. Prohramuvannia, 2016, No 2–3. 3. Nikitchenko M.S., Shkilniak O.S., Shkilniak S.S. Lohiky zahalnykh nedeterminovanykh predykativ: semantychni aspekty // Probl. Prohramuvannia, 2018, No 2–3. 4. Shkilniak O.S. Modalni lohiky nemonotonnykh chastkovykh predykativ // Visnyk Kyivskoho un-tu. Ser.: fiz.-mat. nauky, 2015, vyp. 3. 5. Shkilniak S.S. Pershoporiadkovi kompozytsiino-nominatyvni lohiky z predykatamy slabkoii ta strohoii rivnosti // Probl. Prohramuvannia, 2019, No 3. 6. Handbook of Logic in Computer Science. Edited by S. Abramsky, Dov M. Gabbay and T. S. E. Maibaum. – Oxford Univ. Press, Vol. 1–5, 1993–2000. 7. Kröger F., Merz S. Temporal logic and state systems. – Springer-Verlag, 2008. 8. Schneider K. Verification of Reactive Systems. Formal Methods and Algorithms. – Springer-Verlag, 2004.

Lectures, independent work.

Semester Assessment (by levels): 1. Midterm Exam 1: LO 1.1, LO 1.2, LO 2.1 – 24 points 1. Midterm Exam 2: LO 1.3, LO 2.1 – 20 points 3. Essay: LO 1.1, LO 1.2, LO 3.1, LO 4.1 – 12 points 4. Сurrent evaluation (students' work in classes): LO 3.1 – 4 points Final Assessment (in the form of an exam): – maximum number of points that can be obtained by the student: 40 points; – earning outcomes to be evaluated: LO 1.1, LO 1.2, LO 1.3, LO 2.1; – form of examination and types of tasks: written exam.

Ukrainian