I008 Computational Logic

Faculty of Informatics
Spring 1999
Extent and Intensity
2/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Jiří Zlatuška, CSc. (lecturer)
Guaranteed by
Contact Person: prof. RNDr. Jiří Zlatuška, CSc.
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.
fields of study / plans the course is directly associated with
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.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 1995, Spring 1997, Spring 1998, Spring 2000, Spring 2001, Spring 2002.
  • Enrolment Statistics (Spring 1999, recent)
  • Permalink: https://is.muni.cz/course/fi/spring1999/I008