After successful completion of the course, students are able to distinguish and to apply important concepts, techniques, and results of formal logic and computability theory. Moreover, students who pass the fianl exams should be able to understand and to explain connections between topics like incompleteness of arithmetical calculi, undecidabiltiy, formal provability and expressibility.
- solutions to 6 blocks of exercises - independent solutions expected
- mandatory attendance in 6:exercise classes
- written exam
- oral exam
NOTE: This year, the participants are required to solve 6 blocks of exercises. The solutions are to be uploaded in TUWEL and might have to be presented on the blackboard.
Mandatory exercise sessions: October 13th, November 10th, November 24th, December 1rst, December 15th and December 21rst, 2023.
The exercise part has to completed postively in order to be admitted for the exam.
Knowledge of classical propositional logic and of basic concepts of classical first order logic (logical consequence, interpretations and model structures, satisfiability versus validity, acquaintance with various proof systems), a firm understanding of the syntax/semantic distinction, some experience with formal specification, acquaintance with a range of different programming paradigms (imperative, functional, logical), and automata theory (finite automata, pushdown automata, Turing machines)
NB: If you don't have a firm background in logic yet, you are asked to join special repetitorium classes, which are open to all participants.
