DM846: Logic for Computer Science
The student is expected to have basic understanding of mathematical proofs and to be familiar with the basics of propositional logic and predicate calculus, obtainable e.g. by having followed DM535 Discrete methods for computer science or MM537 Introduction to Mathematical Methods.
Expected learning outcome
- understand the theoretical concepts of soundness, completeness, and decidability
- prove soundness of particular logics
- choose the logic framework most suited for particular computer science applications
- be able to use existing tools for reasoning within particular logics
- deductive systems for propositional logic
- first order logic and subsets thereof, combinatorial logic and type theory
- Curry-Howard isomorphism
- modal and temporal logic
- formal specification and validation
- pi-calculus, tools for logic reasoning
Exam element b)
Project followed by oral exam. The student completes a project and submits a report. The evaluation is based on the report and an oral exam, where the project is presented and the teacher asks about both the project and other topics covered in the course.
The examination form for re-examination may be different from the exam form at the regular exam.
Exam element a)
Indicative number of lessons
- Intro phase: 42 hours
- Skills training phase: 20 hours, hereof tutorials: 20 hours
|Luís Cruz-Filipefirstname.lastname@example.org||Institut for Matematik og Datalogi, Datalogi, Artificial Intelligence, Cybersecurity, and Programming Languages|
|Marco Peressotti||Peressotti@imada.sdu.dk||Institut for Matematik og Datalogi, Datalogi, Artificial Intelligence, Cybersecurity, and Programming Languages|