FI:MA007 Mathematical Logic - Course Information
MA007 Mathematical Logic
Faculty of InformaticsAutumn 2004
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- doc. RNDr. Jiří Kaďourek, CSc. (lecturer)
prof. RNDr. Luboš Brim, CSc. (assistant) - Guaranteed by
- prof. RNDr. Antonín Kučera, Ph.D.
Department of Computer Science – Faculty of Informatics
Contact Person: doc. RNDr. Jiří Kaďourek, CSc. - Timetable
- Mon 16:00–17:50 A107
- Prerequisites
- ! M007 Mathematical Logic && ( M005 Foundations of mathematics || MB005 Foundations of mathematics || MB101 Mathematics I || SOUHLAS)
It is necessary to go in advance through the subject MB005 Foundations of mathematics or through the subject MB101 Mathematics I. It is recommended to go either in advance or simultaneously also through the subject MB008 Algebra I. - Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
- Course objectives
- The contents of this course consists of propositional and predicate logic. The topics covered comprise axioms of propositional and predicate logic, the notions of truth, validity and provability, theories of predicate logic and their models, Gödel completeness theorem and its consequences, including some pieces of information on complete theories.
- Syllabus
- Propositional logic: propositional formulas, truth, provability, completeness theorem
- Predicate logic: predicate formulas
- Semantics of predicate logic: realizations, truth, validity
- Axioms of predicate logic: provability, correctness, deduction theorem
- Completeness theorem: theories, models, Gödel completeness theorem
- Compactness theorem, Löwenheim-Skolem theorem
- Complete theories: elementary equivalence, Los-Vaught theorem
- Literature
- MENDELSON, Elliott. Vvedenije v matematičeskuju logiku. Edited by Sergej Ivanovič Adjan, Translated by F. A. Kabakov. Izd. 2-oje, ispr. Moskva: Nauka. Glavnaja redakcija fiziko-matematičeskoj literatury, 1976, 320 s. info
- ŠTĚPÁNEK, Petr. Matematická logika. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1982, 281 s. info
- KOLÁŘ, Josef, Olga ŠTĚPÁNKOVÁ and Michal CHYTIL. Logika, algebry a grafy. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1989, 434 s. info
- Assessment methods (in Czech)
- Předmět je ukončen písemnou zkouškou.
- Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- The course is taught annually.
- Enrolment Statistics (Autumn 2004, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2004/MA007