Logic (WS2016): Unterschied zwischen den Versionen
Tobias Philipp (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Tobias Philipp (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 17: | Zeile 17: | ||
Please pay attention to our [https://ddll.inf.tu-dresden.de/web/Datei:CL-PS-Guidelines-2014.pdf guidelines]. | Please pay attention to our [https://ddll.inf.tu-dresden.de/web/Datei:CL-PS-Guidelines-2014.pdf guidelines]. | ||
Zeile 22: | Zeile 23: | ||
The tutorial starts Thursday, 13. October. | The tutorial starts Thursday, 13. October. | ||
Slides: | |||
[[:Datei:ws16-logic-history.pdf|History]] | |||
[[:Datei:ws16-logic-propositional.pdf|Propositional Logic]] | |||
Exercise sheets: | |||
[[:Datei:Sheet-1.pdf|Exercise sheet 1]] | [[:Datei:Sheet-1.pdf|Exercise sheet 1]] |
Version vom 10. Oktober 2016, 20:26 Uhr
Logic
Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) in WS 2016
Dozent
- Steffen Hölldobler
Tutor
Umfang (SWS)
- 2/2/0
Module
Leistungskontrolle
- Klausur
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.
Exercise Book
Please pay attention to our guidelines.
Lecture and Teaching Material
The tutorial starts Thursday, 13. October.
Slides:
History Propositional Logic
Exercise sheets:
Exercise sheet 1
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.
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).