Course title | Mathematical Logic |
---|---|
Course code | KMI/MALO |
Organizational form of instruction | Lecture + Exercise |
Level of course | Master |
Year of study | not specified |
Semester | Winter |
Number of ECTS credits | 4 |
Language of instruction | Czech |
Status of course | Compulsory, Compulsory-optional |
Form of instruction | Face-to-face |
Work placements | This is not an internship |
Recommended optional programme components | None |
Lecturer(s) |
---|
|
Course content |
Logic and related disciplines, historical development, mathematical logic, logic in computer science. Propositional Logic (ProL): language of ProL, formulas, truth valuation, truth evaluation of formulas, semantic consequence, tautology, satisfiable formulas, table method. Axiomatic system of ProL: axioms, deduction rules, proof, deduction theorem, provable formulas, selected theorems (substitution, equivalence, neutral formulas), theories, consistency, correctness theorem, completeness theorem. Predicate logic (PreL): language, terms, formulas, basic syntactic notions; semantics: structures for PreL, evaluation of terms and formulas, tautologies, satisfiable formulas, semantics consequence, basic semantic concepts, theories, models. Axiomatic system of PreL: axioms, deduction rules, proof, deduction theorem, extension and conservative extension, constants, provable formulas, variants, consistency. Completeness: correctness, Henkin theory, complete theory, completion theorem, models from constants, canonical structure, completeness theorem. Introduction to Goedel's results on incompleteness, the two incompleteness theorems. Undecidability of predicate logic. Introduction to logic programming: resolution, completeness of resolution, relationship to Prolog. Representative examples of Prolog. Introduction to non-classical logics: fuzzy logic, modal logic, temporal logic. Examples and applications.
|
Learning activities and teaching methods |
Lecture, Demonstration |
Learning outcomes |
The students become familiar with basic concepts of mathematical logic.
1. Knowledge Indetify differences in various types of entailment. |
Prerequisites |
unspecified
|
Assessment methods and criteria |
Oral exam, Written exam
Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam. |
Recommended literature |
|
Study plans that include the course |
Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester | |
---|---|---|---|---|
Faculty: Faculty of Science | Study plan (Version): Applied Computer Science - Specialization in Software Development (2024) | Category: Informatics courses | 1 | Recommended year of study:1, Recommended semester: Winter |
Faculty: Faculty of Science | Study plan (Version): Mathematics (2023) | Category: Mathematics courses | 1 | Recommended year of study:1, Recommended semester: Winter |
Faculty: Faculty of Science | Study plan (Version): Computer Science - Specialization in Artificial Intelligence (2020) | Category: Informatics courses | 1 | Recommended year of study:1, Recommended semester: Winter |
Faculty: Faculty of Science | Study plan (Version): Applied Computer Science - Specialization in Computer Systems and Technologies (2024) | Category: Informatics courses | 1 | Recommended year of study:1, Recommended semester: Winter |
Faculty: Faculty of Science | Study plan (Version): Bioinformatics (2021) | Category: Informatics courses | 1 | Recommended year of study:1, Recommended semester: Winter |
Faculty: Faculty of Science | Study plan (Version): Computer Science - Specialization in General Computer Science (2020) | Category: Informatics courses | 1 | Recommended year of study:1, Recommended semester: Winter |