CUGS CS Review / CUGS CS Core / CUGS CS Advanced
Once a year
Suggested # of Credits
4.0 HE Credits (Higher Education Credits)
Doctoral students having a some background in logics (introductory
The course goal is to provide the participants with a broad
knowledge on modern logics and their applications in computer science,
in particular in artificial intelligence, automated theorem proving and
formal specification and verification of software. Issues on incomplete
and inaccurate information are also discussed.
The participans will learn how to chose and/or develop a logic for
a articular application domain together with proof systems, with the
emphasis on automated verification of satisfiability and validity of
Not yet available.
Proof and model theory: soundness and completeness, semantic
tableaux, natural deduction, sequent calculus, resolution, Horn
theories, logic programming. Not all proof methods will be covered, but
selected methods will be covered in depth.
Selected issues in meta theory of which the following are
representative issues: Lowenheim-Skolem theorem, Herbrand's theorem,
compactness, Lindström's theorem, Gödel's incompleteness
theorem, axiomatization of natural, rational and real numbers.
Introduction to non-standard logics: modal logic, 2nd-order
Department of Computer Science, Linköping University
See course schedule.
Take home exam/assignment.
The course is given in an intensive format ("crash course") at a