Logic (WS2016)

Logic

Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) in WS 2016

Dozent

• Steffen Hölldobler

Tutor

• Tobias Philipp

Umfang (SWS)

• 2/2/0

Module

• MCL-F
• EMCL-B-F

Leistungskontrolle

• Klausur

• Information

This course will introduce you to propositional logic and first-order predicate logic. After reviewing syntax and semantics, we will cover some basic concepts like normal forms, substitution, and unification. You will be introduced to proof procedures such as the resolution calculus and related concepts including soundness, completeness, and decidability.

Lecture and Teaching Material

The tutorial starts Thursday, 13. October.

Slides

History Propositional Logic

Exercise sheets

Exercise sheet 1

Exercise Book

Please pay attention to our guidelines.

Test Exam

We plan to run one test exam on Thursday, 17th November

<-- where participation is compulsory and results will count for 10% of the final grade.

The other 90% are determined by the score of the written exam However, this only holds if you pass the exam on the first attempt. If you fail, your grade will solely be determined by the score of your second attempt.

Test Exam 1: Monday 2th November

Test Exam 2: Wednesday, 9th December

Final Exam: 19th December, 10am in Room ZEU/255/Z (Zeunerbau, Georg-Bährstrasse 3c). --> Written Exam

This course will be examined as a part of the Foundations exam. The Foundation exam consists of two separate exams: a written examination for the course Logic and an oral examination for the course Science of Computational Logic. The written exam is scheduled shortly before Christmas (the preliminary date is 10th December).

Some remarks on the style of the written exam in logic

• no exam aids or support materials will be allowed. In other words, only writing materials are allowed.
• The emphasis of the exam will be on the proofs of theorems, propositions and lemmata from the lectures and the proofs occurring with the problems from the tutorials.
• In addition, in the first problem of the exam we will usually ask for some definition or algorithm presented on the lectures, e.g. define concepts like substitution, resolvent, interpretation, Skolemization, ... or algorithms like unification, transformation to clause form, ...
• Maybe, one or two exam problems will be the application of some of the presented calculi (e.g. resolution, natural deduction, normalform transformation, etc).