TCS / Studies / Tik-79.144 / 2000
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Tik-79.144 Logic in Computer Science: Foundations

Autumn 2000


This is an introductory course on logic and its applications in computer science. Subjects covered are: propositional and predicate logic, model theory, proof theory, semantic/analytic tableaux, resolution.

[General Information] [Material] [Examinations] [Feedback] [Home Assignments] [Program] [TOPI] [Autumn 2001] [Autumn 1999]

General Information


Material


Examinations


Feedback

It is now possible to give feedback by filling a form.


Home Assignments


Lectures and Tutorials

Timetable and contents

September 12: Lecture 1 (pages 1-16, slides 1-11)
Introduction, syntax of propositional logic
Tutorial 1 (in English), solutions (in English).
September 21: Lecture 2 (pages 17-36, slides 12-30)
Truth tables and semantic tableaux
Tutorial 2 (in English), solutions (in English).
September 26: Lecture 3 (pages 37-48, slides 31-39, 43-45)
Soundness and completeness of semantic tableaux, Hilbert-style axiomatization
Tutorial 3 (in English), solutions (in English).
October 3: Lecture 4 (pages 49-51, slides 40-42, 46-56)
Normal forms and the resolution rule
Tutorial 4 (in English), solutions (in English).
October 10: Lecture 5 (pages 52-68, slides 57-73)
Resolution proofs and computational complexity
Tutorial 5 (in English), solutions (in English).
October 17: Lecture 6 (pages 81-99, slides 74-98)
Syntax and semantics of predicate logic
Tutorial 6 (in English), solutions (in English).
October 24: Lecture 7 (pages 108-126, slides 99-111)
Semantic tableaux for predicate logic
Tutorial 7 (in English), solutions (in English).
October 31: Lecture 8 (pages 127-141, slides 112-125)
Hilbert-style axiomatization, normal forms, Skolemization, Herbrand's theorem, unification
Tutorial 8 (in English), solutions (in English).
November 7: Lecture 9 (pages 142-153, slides 126-141)
Unification algorithm, resolution rule
Tutorial 9 (in English), solutions (in English).
November 14: Lecture 10 (pages 154-158, slides 142-168)
Resolution proofs, representing knowledge using logic
Tutorial 10 (in English), solutions (in English).
November 21: Lecture 11 (pages 69-80 and 159-202, slides 169-203)
Theorem prover OTTER, logic programming
Tutorial 11 (in English), solutions (in English).
November 28: Lecture 12 (slides 204-228)
Negation in PROLOG, rule-based reasoning, applications of induction principle
Tutorial 12 (in English), solutions (in English).
December 5: Review of lectures 1-12
A rehearsal exam is handled in the tutorials.


Latest update: October 2, 2001 by Tomi Janhunen