inf400 - Theoretical Computer Science: Logic (Complete module description)

Module label	Theoretical Computer Science: Logic
Modulkürzel	inf400
Credit points	6.0 KP
Workload	180 h
Institute directory	Department of Computing Science
Verwendbarkeit des Moduls	Bachelor's Programme Computing Science (Bachelor) > Basismodule Computing Science (Extension tray) > Computing Science Computing Science (Extension tray) > Module Dual-Subject Bachelor's Programme Computing Science (Bachelor) > Wahlpflicht Theoretische Informatik (30 KP) Master of Education Programme (Gymnasium) Computing Science (Master of Education) > Wahlpflichtmodule (Theoretische Informatik) Master of Education Programme (Vocational and Business Education) Computing Science (Master of Education) > Akzentsetzungsbereich
Zuständige Personen	Wehrheim, Heike (module responsibility) Matheja, Christoph (module responsibility) Lehrenden, Die im Modul (Prüfungsberechtigt)
Prerequisites
Skills to be acquired in this module	Introduction to propositional logic and predicate logic. Professional competence The students: know syntax, semantics and applications of propositional logic, and predicate logic specify problems by using logical formulas solve questions concerning propositional formulas with truth tables draw conclusions in the field of propositional logic and predicate logic by means of natural deduction axiomatise logical structures and theories encode decision problems as logical formulas and solve them with automated theorem provers Methodological competence The students: recognize logic as a versatile tool in computer science Social competence The students: work together in small groups to solve problems present solutions to problems to groups of other students Self-competence The students: learn persistence in pursuing difficult tasks learn precision in writing down solutions
Module contents	The course introduces propositional logic and predicate logic. In computer science it is essential to have a good understanding of logic. For example, Boolean expressions appear in every programming language and in circuit design. Horn clauses are used in knowledge representation. Predicate logic is used for specifying software and hardware. More recent applications such as interactive and automatic theorem proving emphasize the tool character of logic in computer science. The course introduces syntax, semantics, procedures, and calculi to prove the validity of formulas of propositional and predicate logic. This is illustrated by many examples. Central is the concept of logical entailment. Topics: propositional logic: syntax and semantics, truth tables, natural deduction predicate logic: syntax and semantics, natural deduction, definability, satisfiability modulo theories
Literaturempfehlungen	Will be announced in the lecture.
Links
Language of instruction	German
Duration (semesters)	1 Semester
Module frequency	annual
Module capacity	unrestricted
Teaching/Learning method	V+Ü
Previous knowledge	Nützliche Vorkenntnisse: Grundlagen der Mengenlehre, Definition von Funktionen und Relationen

Lehrveranstaltungsform	SWS	Frequency	Workload of compulsory attendance
Lecture	3	SoSe	42
Exercises	1	SoSe	14
Präsenzzeit Modul insgesamt			56 h

Examination	Prüfungszeiten	Type of examination
Final exam of module	At the end of the lecture period	written exam or oral exam