|Module label||Theoretical Computer Science: Logic|
|Credit points||6.0 KP|
|Faculty/Institute||Department of Computing Science|
|Used in course of study||
|Skills to be acquired in this module||
Introduction to propositional logic, predicate logic, logic programming, and temporal logic
The course introduces propositional, predicate and temporal logic. In computer science it is essential to have a good understanding of logic because the language of logical formulas is widely used in the field of computer science. For example, Boolean expressions appear in every programming language and in circuit design; Horn clauses are used in knowledge representation; predicate logic and temporal logic are used for specifying software and hardware. More recent applications such as interactive and automatic proving as well as the logic programming language PROLOG 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, predicate, and temporal logic. This is illustrated by many examples.
Central is the concept of logical consequence.
Good secondary reading:
|Language of instruction||German|
|Duration (semesters)||1 Semester|
|Modullevel||BC (Basiscurriculum / Base curriculum)|
|Modulart||Pflicht / Mandatory|
|Lern-/Lehrform / Type of program||V & Ü|
|Vorkenntnisse / Previous knowledge|
|Course type||Comment||SWS||Frequency||Workload attendance|
|Exercise or tutorial||1.00||SuSe||14 h|
|Total time of attendance for the module||56 h|
|Examination||Time of examination||Type of examination|
|Final exam of module||
At the end of the lecture period
written exam or oral exam