Formal-mathematical groundworkModule description #41281 / Version 1
- 6 CP
- Written exam
- Graded
- Summer semester
- German
| Module / Version | #41281 / #1 |
|---|---|
| Validity | Since Summer semester 2026 |
| Available language(s) | English, German |
| Credit points | 6 |
| Person responsible for the module | Nestmann, Uwe |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351900 FG Modelle und Theorie Verteilter Systeme (MTV) |
Contact
| Office | EN 24 |
|---|---|
| Contact person | Nestmann, Uwe |
| E-mail address | fog@mtv.tu-berlin.de |
| Website | https://www.tu.berlin/mtv/lehre/module-und-veranstaltungen/bachelormodule/fog |
Learning outcomes
Graduates of this module master a fundamental set of formal-mathematical and logical foundations of computer science. They have acquired substantial proof competence, meaning they are able to assess the formal correctness of patterns of reasoning based on propositional and predicate logic. Ideally, they are also capable of independently constructing structured and logically sound arguments in the sense of basic mathematical proofs. They can abstract from concrete situations to general contexts and move back to the concrete as needed. They are aware of the different levels of object language and metalanguage. They are able to work on corresponding tasks related to all of the above both independently-especially using software tools-and collaboratively in small groups.
Content
- fundamentals of set theory
- inference rules as a definitional principle
- natural deduction in propositional and predicate logic
- logical equivalence, proof structures, and proof principles
- object language and metalanguage
- basic discrete structures (relations, mappings, equivalence relations)
- the significance of (un)countability in computer science
- abstract and universal algebra
- structural induction and pattern matching
- induction versus recursion
- formal (un)computability
- inference rules as a definitional principle
- natural deduction in propositional and predicate logic
- logical equivalence, proof structures, and proof principles
- object language and metalanguage
- basic discrete structures (relations, mappings, equivalence relations)
- the significance of (un)countability in computer science
- abstract and universal algebra
- structural induction and pattern matching
- induction versus recursion
- formal (un)computability
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Formal-mathematische Grundlagen (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 2 h | 30 h |
| 60 h | |||
Formal-mathematische Grundlagen (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 4 h | 60 h |
| 90 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam preparation | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The lecture is designed in a rather traditional format. It also incorporates the web application ProofBuddy, whose use is explained during the course. In the integrated session, conducted in the style of a large-group exercise session, traditional blackboard work alternates with computer-based work. In addition, tutor-supported practice sessions are offered in the style of an open learning space.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Knowledge comparable to the module "Analysis 1 und Lineare Algebra für Ingenieurwissenschaften"
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | German |
| Duration/Extent | 3 hours |
Exam description
The examination also includes proof-based tasks. It is designed so that well-prepared students can complete it within 2 hours. However, we allow a total of 3 hours to ensure that students can work on the proof tasks without excessive time pressure.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Information via ISIS course.
Exam registration via Moses.
Exam registration via Moses.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
No recommended literature given
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Science Computer Science (B. Sc.) - StuPO 2015 | SS 2026 | Pflichtbereich |
| WS 2026/27 | Pflichtbereich › Theoretische Grundlagen der Informatik | |
| Computer Science Computer Science (B. Sc.) - StuPO 2025 | WS 2026/27 | Pflichtbereich › Mathematisch-algorithmisch-konzeptionelle Kompetenzen |
Miscellaneous
Not specified