FI:I008 Computational Logic - Course Information
I008 Computational Logic
Faculty of InformaticsSpring 2001
- Extent and Intensity
- 2/0. 3 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. Lubomír Popelínský, Ph.D. (lecturer)
Mgr. Miloslav Nepil, Ph.D. (seminar tutor) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: doc. RNDr. Lubomír Popelínský, Ph.D. - Timetable
- Thu 17:00–18:50 D1 and each odd Monday 13:00–14:50 D2 and each even Monday 13:00–14:50 D2
- Timetable of Seminar Groups:
I008/2: No timetable has been entered into IS. - Prerequisites
- Completion of M007 Mathematical Logic is welcome, but it is not strictly required.
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 253 student(s).
Current registration and enrolment status: enrolled: 0/253, only registered: 0/253, only registered with preference (fields directly associated with the programme): 0/253 - fields of study / plans the course is directly associated with
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Syllabus
- Essentials of proof theory in propositional and first-order predicate logic: sequent calculus and resolution.
- Technical notions: trees, König lemma, formulae analysis, abstract truth-tables, clausal and dual clausal form.
- Proofs in the propositional logic: system G, soundness, completeness, proof structure, compactness, cut elimination; resolution, refinements of the resolution, Horn clauses, SLD-resolution.
- Proof in the propositional logic: substitution, system G, compatness, Skolem-Löwenheim theorem, Herbrand theorem; prenex form, Skolemization, unification, resolution and its refinements, Horn clauses, SLD-resolution.
- Logic programming: SLD-serching, SLD-resolution trees, semantics.
- Literature
- FITTING, Melvin. First order logic and automated theorem proving. 2nd ed. New York: Springer, 1996, xvi, 326. ISBN 0387945938. info
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Enrolment Statistics (Spring 2001, recent)
- Permalink: https://is.muni.cz/course/fi/spring2001/I008