Winter 2024/25
Automaten und formale Sprachen
Automata and Formal Languages
03-IBGT-THI1-AFS
Vorlesung
ECTS: 4,5
Termine:
wöchentlich Mo 08:00 - 10:00 MZH 6200 Übung
wöchentlich Mo 14:00 - 16:00 Externer Ort: Übung Online
wöchentlich Mo 14:00 - 16:00 MZH 1450 Übung
wöchentlich Mo 14:00 - 16:00 MZH 1470 Übung
wöchentlich Di 16:00 - 18:00 NW2 C0290 (Hörsaal 1) Vorlesung
wöchentlich Mi 08:00 - 10:00 MZH 1100 Übung
Set Theory and Model Theory (in englischer Sprache)
03-IMAT-STMT
Vorlesung
ECTS: 6
Termine:
wöchentlich Di 14:00 - 16:00 MZH 3150 Vorlesung
wöchentlich Mi 12:00 - 14:00 MZH 3150 Übung
Profil: SQ
Schwerpunkt: IMVT-SQ
https://lvb.informatik.uni-bremen.de/imat/03-imat-stmt.pdf
Set theory and model theory
Intuitively, a set is a collection of all elements that satisfy a certain property. This intuition, however, is false! The following example is known as Russell's Paradox. Consider the set S whose elements are exactly those that are not members of themselves: S = { X : X is not element of X }. Is S an element of S? If S is an element of S, then S is not an element of S. On the other hand, if S is not an element of S, then S belongs to S. In either case we have a contradiction. We must revise our intuitive notion of a set. In the first part of the lecture we develop axiomatic set theory (ZFC) in the framework of first-order logic, which forms the foundation of modern mathematics. We cover the axioms of set theory, ordinal numbers and induction and recursion over well-founded relations, cardinal numbers and the axiom of choice.
In the second part of the lecture we turn to classical topics of first-order model theory. Model theory studies classes of mathematical structures, such as groups, fields, or graphs, from the point of view of mathematical logic. Many notions, such as homomorphisms, substructures, or free structures, that are commonly studied in specific fields of mathematics are unified by the general approach of model theory. We study ways to construct models with desired properties from first-order theories and the expressive power of first-order logic.
Sparsity - Graphs and algorithms
03-IMVT-SGA
Vorlesung
ECTS: 6
Termine:
wöchentlich Mo 14:00 - 16:00 MZH 3150 Vorlesung
wöchentlich Do 12:00 - 14:00 MZH 3150 Übung
Profil: SQ
Schwerpunkt: IMVT-SQ
https://lvb.informatik.uni-bremen.de/imvt/03-imvt-sga.pdf
Siehe folgenden Link:
https://www.szi.uni-bremen.de/lehre/modulhandbuecher/
(ganz unten).