Course details
Introduction to Logic for Computer Science
IZLO Acad. year 2022/2023 Summer semester 2 credits
Formal propositional and predicate logic. Syntax and semantics of formulae. Normal forms and algebraic manipulation with formulae. Formal proof as a sequence of applications of syntactic rules originating in axioms. First order theories, models. Notions of correctness, soundness, completeness. Usage of SAT and SMT solvers. Connections of proving and computation, existence of their limits following from Gödel's theorems.
Guarantor
Course coordinator
Language of instruction
Completion
Time span
- 10 hrs lectures
- 12 hrs exercises
- 2 hrs projects
Assessment points
- 80 pts final exam
- 20 pts projects
Department
Lecturer
Instructor
Harmim Dominik, Ing. (UITS)
Havlena Vojtěch, Ing., Ph.D. (UITS)
Holík Lukáš, doc. Mgr., Ph.D. (UITS)
Lengál Ondřej, Ing., Ph.D. (UITS)
Síč Juraj, Mgr. (UITS)
Subject specific learning outcomes and competences
Orientation in the notions of mathematical logic such as term, formula, axiom, proof, syntax, semantics, satisfiability, validity, correctness, soundness, axiom, proof. Familiarity with the language of propositional and predicate logic: thorough understanding of the meaning and usage of their symbols: connectives, quantifiers, logical variables. Ability to write and read texts with elements of formal notation. Improvement of overall ability to express oneself and to think formally and accurately. Basic knowledge of the most fundamental results in mathematical logic, Gödel's theorems, and their relevance to computer science. Awareness of the practical use of SAT and SMT solvers.
Learning objectives
Introduction to most basic concepts, terminology, and results of classical mathematical logic (syntax, semantics, formal proof in propositional and predicate logic); training of formal expression using the apparatus of mathematical logic; introduction to the connection with computing, formal reasoning, and their limits; introduction to the technology of automated logical reasoning—SAT and SMT solving.
Why is the course taught
The basic notions and concepts of mathematical logic were at the very beginning of computer science and permeate it at every step. They underlie logic circuits, processors, and almost every formal system or language, including programming languages, specification, and modeling. Becoming thoroughly familiar with basic notions of logic in their original form will help to navigate the derivative concepts of modern computer science.
Studying mathematical logic, the science of formal expression and reasoning, is also a unique opportunity to thoroughly practice precise expression and reasoning, a critical skill in any field of IT. A computer scientist constantly needs to assimilate, create, and communicate complex algorithms, models, systems, specifications, ...
SAT and SMT solving is an example of practical use of the theory taught. It is a versatile technology applicable in planning, arithmetic problem solving, graph problems, program analysis, testing, and verification, and other areas.
Finally, the basic facts about the connection between computing, formal reasoning, and mathematical proof, and the existence of their limits arising from Gödel's theorems, are among the most fundamental theoretical insights in computer science.
Prerequisites
- Discrete Mathematics (IDM)
Prerequisite knowledge and skills
Basics of discrete mathematics and its notation, sets, relations, functions.
Study literature
- Herbert B. Enderton. A Mathematical Introduction to Logic. Academic Press, 2001. ISBN 978-0122384523
Fundamental literature
- Herbert B. Enderton. A Mathematical Introduction to Logic. Academic Press, 2001. ISBN 978-0122384523
- Michael Huth and Mark Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, 2004. ISBN 978-0521543101
- Peter Smith. An Introduction to Formal Logic. ISBN 978-1916906327 https://www.logicmatters.net/ifl/
- Peter Smith. Gödel Without (Too Many) Tears. ISBN 979-8673862131 https://www.logicmatters.net/igt/
- Doxiadis A, Papadimitriou C. LOGICOMIX: an epic search for truth. Bloomsbury Publishing USA; 2015 Jul 28. ISBN 978-1596914520
Syllabus of lectures
- Introduction, syntax and semantics of propositional logic, satisfiability, validity, truth tables, conjunctive and disjunctive normal form, algebraic manipulations with formulas, complete systems of connectives.
- Syntax and semantics of predicate logic.
- Normal forms and algebraic manipulation with predicate formulas. Theories in predicate logic.
- Formal proof. Proof from axioms by inference rules. The relation between syntax and semantics. Efficient, correct, complete proof systems.
- Soundness and completeness of first-order theories. The relation between computation and proof, mechanization of mathematics and PL theories, Gödel's incompleteness theorems.
Syllabus of exercises
- Propositional logic: formalization of statements, formula satisfaction, truth tables, conversions to CNF and DNF.
- Predicate logic: quantifiers and variables. Formalizing and understanding formulas 1.
- Predicate logic: language interpretation, models of formulas. Formalization and understanding formulas 2.
- Algebraic modifications and conversions to normal forms.
- Formal proof.
Syllabus of numerical exercises
- SAT and SMT solving
Syllabus - others, projects and individual work of students
- Use of SAT solvers
- Use of SMT solvers
Progress assessment
Evaluation of the project, which will consist of two homeworks: 1) use of SAT solver, 2) use of SMT solver.
Controlled instruction
The project is evaluated with a maximum of 20 points, the written exam with a maximum of 80 points. For successful completion of the course, you must obtain at least 50 points out of the 100 and also half of the points from the final exam (i.e. 40 points of the 80).
Schedule
Day | Type | Weeks | Room | Start | End | Capacity | Lect.grp | Groups | Info |
---|---|---|---|---|---|---|---|---|---|
Mon | exam | 2023-05-22 | D0206 D0207 D105 | 09:00 | 10:50 | 1. oprava | |||
Mon | exercise ^{*)} | 2023-02-06 | A113 D0207 | 09:00 | 10:50 | 9999 | 1BIA 1BIB 2BIA 2BIB | xx | |
Mon | exam | 2023-05-15 | D0206 D0207 D105 E112 | 14:00 | 15:50 | řádná | |||
Mon | exercise | 2., 6., 8. of lectures | G202 | 15:00 | 16:50 | 53 | 1BIA 1BIB 2BIA 2BIB | xx | Lengál |
Mon | exercise | 2023-02-27 | G202 | 15:00 | 16:50 | 53 | 1BIA 1BIB 2BIA 2BIB | xx | Holík |
Mon | lecture | 1., 3., 5. of lectures | D0206 D105 | 17:00 | 18:50 | 9999 | 1BIA 2BIA 2BIB | xx 10 - 29 | Lengál |
Mon | lecture | 7., 9., 11. of lectures | D0206 D105 | 17:00 | 18:50 | 9999 | 1BIA 2BIA 2BIB | xx 10 - 29 | Holík |
Tue | exercise | 2., 4., 6., 8. of lectures | A113 | 08:00 | 09:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Lengál |
Tue | exercise | 2., 4., 6., 8. of lectures | D0207 | 08:00 | 09:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Holík |
Tue | exercise | 2., 4., 6., 8. of lectures | D0206 | 11:00 | 12:50 | 53 | 1BIA 1BIB 2BIA 2BIB | xx | Holík |
Tue | exercise | 2., 4., 6., 8. of lectures | D0207 | 16:00 | 17:50 | 52 | 1BIA 1BIB 2BIA 2BIB | xx | Dacík |
Tue | exercise | 2., 4., 6., 8. of lectures | D0207 | 18:00 | 19:50 | 51 | 1BIA 1BIB 2BIA 2BIB | xx | Dacík |
Wed | exercise | 2., 4., 6., 8. of lectures | G202 | 14:00 | 15:50 | 53 | 1BIA 1BIB 2BIA 2BIB | xx | Dacík |
Wed | exercise | 2., 4., 6., 8. of lectures | G202 | 16:00 | 17:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Dacík |
Thu | exercise | 2., 4., 6., 8. of lectures | D0207 | 08:00 | 09:50 | 51 | 1BIA 1BIB 2BIA 2BIB | xx | Síč |
Thu | exercise | 2., 4., 6., 8. of lectures | G202 | 10:00 | 11:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Síč |
Fri | exercise | 2., 4. of lectures | D0207 | 08:00 | 09:50 | 70 | 1BIA 1BIB 2BIA 2BIB | xx | Lengál |
Fri | exercise | 7., 8. of lectures | D0207 | 08:00 | 09:50 | 70 | 1BIA 1BIB 2BIA 2BIB | xx | Síč |
Fri | exercise ^{*)} | 2023-02-17 | G202 | 08:00 | 09:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Síč |
Fri | exam | 2023-05-05 | D0206 D105 | 10:00 | 11:50 | předtermín | |||
Fri | lecture | 1., 3., 5. of lectures | D0206 D105 | 10:00 | 11:50 | 9999 | 1BIB 2BIA 2BIB | xx 30 - 49 | Lengál |
Fri | lecture | 7., 10., 11. of lectures | D0206 D105 | 10:00 | 11:50 | 9999 | 1BIB 2BIA 2BIB | xx 30 - 49 | Holík |
Fri | exercise | 2., 4., 7., 8. of lectures | D0207 | 12:00 | 13:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Holík |
Fri | exercise | 2., 7., 8. of lectures | G202 | 12:00 | 13:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Síč |
Fri | exercise | 2023-03-03 | G202 | 12:00 | 13:50 | 50 | 1BIA 1BIB 2BIA 2BIB | xx | Lengál |
Fri | exam | 2023-06-02 | D0206 D0207 D105 E112 | 15:00 | 16:50 | 2. oprava |
Course inclusion in study plans
- Programme BIT, 1st year of study, Compulsory
- Programme BIT (in English), 1st year of study, Compulsory
- Programme IT-BC-3, field BIT, 1st year of study, Compulsory