- 39
- 35 831
bodirsky
Germany
Приєднався 29 сер 2008
This channel complements the material of my university courses at TU Dresden, started during the 2020 Corona lockdown.
So far, this mainly concerns the course "Graph Homomorphisms and Universal Algebra".
So far, this mainly concerns the course "Graph Homomorphisms and Universal Algebra".
Satz von Menger
Der Satz von Menger wird vorgestellt, illustriert, motiviert, und bewiesen.
Переглядів: 777
Відео
First-order Interpretations
Переглядів 5253 роки тому
An introduction to first-order interpretations in model theory. We have present three examples: the interpretation of the field of rationals in the ring of integers, the interpretation of the line graph of a graph G in G, and the interpretation of Allen's interval algebra in the order of the rational numbers. We prove that first-order interpretations preserve countable categoricity, and explain...
What I teach in ... Combinatorics
Переглядів 4153 роки тому
An overview about the course "Combinatorics" that I will teach at TU Dresden in the winter semester 2021/22, given in the Seminar "Algebra, Geometry, and Combinatorics".
Countably Categorical Structures
Переглядів 5133 роки тому
The video introduces countable categoricity and present the theorem of Engeler, Ryll-Nardzewski, and Svenonius, its proof, and some examples. In this second version I corrected a mistake in a formula, and added more examples.
Omitting Types
Переглядів 5563 роки тому
This video presents the omitting types theorem, including its proof. We present an application about the existence of atomic models of certain theories.
Amalgamation
Переглядів 6603 роки тому
The video explains how to build countable structures with a large automorphism group from classes of finite structures that satisfy a combinatorial property, called the amalgamation property. Many examples are discussed.
Phylogenetische Rekonstruktion
Переглядів 4283 роки тому
In diesem Video geht es um die Frage, wie man einen Stammbaum einer Virenpopulation Anhand von Messdaten über mögliche Mutationen bestimmen kann. Insbesondere wir der Algorithmus von Aho, Sagiv, Syzmanski und Ullman erklärt.
Ultraproducts
Переглядів 2,1 тис.3 роки тому
The video presents a proof of the completeness theorem of first-order logic based on the ultraproduct construction. The compactness theorem is then applied to prove the Loewenheim-Skolem theorem.
Cardinals
Переглядів 8453 роки тому
This is a follow-up video on my video about ordinals. I prove the theorem of Cantor and Bernstein and then the theorem of Cantor about the cardinality of the power set. I define cardinals, introduce the aleph hierarchy, and present some basic rules for computing with cardinals.
Model theory: counting models
Переглядів 6 тис.3 роки тому
This is the first video of an introduction to model theory, complementing course material of a course at TU Dresden for bachelor students in mathematics and computer science in their third year. Some basic knowledge about structures and first-order logic is required. Topics are Vaught's conjecture, (elementary) chains, limits, the Tarski-Vaught lemma, Tarski's test, and the Löwenheim-Skolem the...
Minimal Clones
Переглядів 1263 роки тому
This video defines minimal clones and proves some basic facts about minimal clones. In the second version of the video, the proof of the Lemma of Swierczkowski has been improved. In my course "Graph Homomorphisms and Universal Algebra" this is the follow-up video to the video titled "Clones", and it is needed for the video about Schaefer's theorem.
Oligomorphic Clones, Part 2
Переглядів 673 роки тому
This is the second part of a tutorial of Manuel Bodirsky held at the conference AAA 100, Krakow (virtual because of the Corona pandemic). In the second part we discuss an important application of oligomorphic clones, namely complexity study for infinite-domain constraint satisfaction problems. However, I also mention questions in finite model theory where oligomorphic clones appear systematical...
Oligomorphic Clones, Part 1
Переглядів 993 роки тому
A tutorial at AAA 100, Krakow, which was held online. Part 1 covers oligomorphic clones from a universal algebra perspective and part 2 is mainly about the application of oligomorphic clones for the study of constraint satisfaction problems on infinite domains.
The Completeness Theorem
Переглядів 3,5 тис.3 роки тому
This video presents a Hilbert-style proof system, and shows that the system is complete, using Henkin's construction.
Applications of the Compactness Theorem
Переглядів 1 тис.4 роки тому
Applications of the Compactness Theorem
Temporal Constraint Satisfaction Problems in Fixed Point Logic
Переглядів 5394 роки тому
Temporal Constraint Satisfaction Problems in Fixed Point Logic
🔥🔥🔥
phd studentin von Dir? :D
this channel is a real gem
Probably my favorite video on youtube, big fan
Bring back those videos. We need more formal videos on foundations of knowlegde
Love it!!!!!!
Microseconds be like: 15 15 15 60 Microseconds later: 23 10⁶ 10^10^100 TREE(3) Omega
Thanks, what source do you recommend?
Bouldering during lockdown is also NP hard😹
By model, do you mean group, ring, etc.?
Groups and rings are examples of (first-order) structures. I use "model" when I talk about structures that satisfy some set of (first-order) sentences.
Wow! I got lost early in the video due to the jargon. I understand isomorphisms, but I did not comprehend the other definitions. I will need to think about the statement "clearly the two structures are not isomorphic".
Super interesting video and really understandable, even for me as a set theory beginner. Thank you for sharing!
Just started watching this lecture series. Thanks for making it open to the public. If it is not too personal I'd like to ask if you are a dj since it seems that way judging by your profil picture. It would be interesting because not many mathematicians I know have this hobby
Great video! You briefly talked about categoricity, I think you should make a video on categoricity transference (specifically in infinitary logics) and abstract elementary classes.
Yes, this would be interesting, and it would be great to have a video about it! Helas, at the moment I am fully booked out with teaching linear algebra II which is in old-fashioned black board style, without video...
@@bodirsky That is unfortunate. Although it is still a good video idea for later. Good luck on your teaching, you helped me fill some of the gaps in my knowledge about model theory.
Ich finde es so schade, dass nicht alle Profs ihre Videos so gestalten. Vor allem bei der Mathematik. Also da hat Prof. Bodirsky einen sehr guten Weg gefunden, um das Interesse der Studenten zu wecken.
Manuel Bodirsky ist einer der besten Profs an TUD. Ganz ehrlich, wer wünscht sich nicht so einen Prof?
Ich glaube bei 0:06 hast du dich verschrieben. Ich glaube ich bin aber auch der einzige, der sich diese Aussagen angesehen hat. XD
I quickly ceased to understand, but I certainly appreciate this video.
I'm curious: what was the first place where something was unclear (this will help me when -- some day.... -- I will make another video.
same here
great videos!!!
I have the book Model Theory by Cheng and I'm trying to work through it. It's quite dense. The first chapter talks about semantics, syntax, and theories. Maybe you can explain why these distinctions are made as it seems to me to all be the same(and which it is since he proves they are the same). It seems to me that the distinctions add unnecessary complexity through obfuscation rather than serving any actual theoretical purpose. At best all I can come up with is that historically semantics, theories, and syntax were thought of differently because the theories connecting them were not well developed. When I learned logic it was more from the syntactical approach and that is typically how I break things down. About all I have gotten out of the distinctions is that there are typically 3 approaches to think about propositional logic which as only helped me in realizing why some forms of thinking seem "off" to me... and it is because they are semantic approaches. Other than that I can't seem to reconcile why one should go to the trouble of making the distinction, maybe you have some good reason why it is done? I haven't worked through model theory much but I've always had in the back of my head that there was far more to theories and Chengs book seems to make it explicit(and I guess that is what model theory is all about). But it seems overly formalized in a way that feels very pedantic without real purpose(I haven't worked though the book yet though so I'm hoping there is more to it). I do have an extensive background in logic but more from a mathematicians point of view and along the lines of simply learning mathematical theories, category theory, basic logic courses, computation/computer science, etc. I always feel a little uneasy in when logicians present their material. I've seen the same thing but the way they go about it always feels like they haven't learned abstract syntax tree's, category theory, and the like(obviously they know something about it but the language jargon seems to be geared towards something else). Of course maybe the point is not to be circular but pretty much all life is circular in some sense. For example, Models are defined as simply a subset of a language of sentence symbols. Then one makes a relation between models and "truth tables" by assigning values. What's the point? It's it solely for language? I grew up with truth tables and I automatically translate models in to truth labels. It seems perfectly natural to do this... but if there is a distinction being made it makes me think I'm doing it wrong. It really makes no sense to me to say something is "true in a model" and "true in a truth table" as different statements(but only the 2nd is natural to me). Now if I assume historically it wasn't know they were equivalent then fine, I get it but I then rather learn model theory that doesn't make the historical distinction since it's much more work to track the unnecessary differences while trying to learn the technicalities of model theory. (learning something should be as easy as possible, not unnecessarily complicated)
Hey professor -- if you could include definitions in future videos, I think it would make these videos more usable for self-study :) So a relational structure \( C = (c, \{ \gamma_i : i \in I \} ) \) is a set \( c \) and set of relations \( \{ \gamma_i : i \in I \} \) on \( c \), and a substructure \( D = (d, \{ \delta_j : j \in J \} ) \) is just a subset \( d \subseteq c \) and set of relations \( \{ \delta_j : j \in J \} \subseteq \{ \gamma_i : i \in I \} \) on \( d \) ? When I embed \( A \) into \( C \), I inject \( a \overset{f}{\hookrightarrow} c \) such that \( \{ f(\alpha_k) : k \in K \} \subseteq \{ \gamma_i : i \in I \} \) ?
Hi! There are videos earlier in the playlist "Introduction to mathematical logic" which properly introduce structures and embeddings.
Thank you for video!
Zermelo-Frenkel deez nuts
hi
hi
muy bien
Tres Good!
It is amazing how such hidden gems as this lecture shed light to platonic dialogues such as Cratylous and Parmenides and Republic and Timaeus and Theaitetus.
? What do you mean? Do you mean abstractly? As far as I know none of those things really use model theory in any way except, of course in the sense that all thinking is model theory(but then no need to pick out any specific instances as if they are one of just a few). The Greeks were heavily in to logic, of course, and our modern logical theories are just expansions on it... but all thinking is based in logic so it wasn't just the Greeks doing it(but they did it well and made a big stink about it which I think some of us which we could get back to).
I mean nothing. I mean something that coexists in abstract but also exists in the negation of abstract. And platonic dialogue is guiding me in that pursuit. Thank you for getting into trouble to reply ..
@@nikitasmarkantes5046 lol. Well, negation of abstract would be concrete. So you are saying something that is both abstract and concrete. Technically the terms are duals/opposites so if something is in both then it transcends those concepts. By excluded middle such things cannot exist. But maybe you do not take excluded middle as tautological? If you are referring to feeling something deeper in the logic of the ancient Greeks then, well, simply study logic, category theory, math, and model theory... you will see the tree that has grown from the seeds they planted. Model theory is pretty much the culmination of understanding the ramifications of their logical system and it transcends "logic" in to all fields of thought. Logic = intelligence = thought. It might be difficult to comprehend how such at theory can say so much about everything when it seems to say so little and only about logic but once you realize our brains are logic machines then it is natural to see how all things our brains do(which basically is everything because without our human brains we are animals) is based in logical theories in some form or fashion. Maybe these "hidden gems" you are speaking of are tautologies or invariant which are special things that exist in theories that act as "ultimate truths" which "theories" are built around. Basically things as close to "god" as we can get.
May be these hidden gems are invariant may be they are not maybe they are both and nothing...may be they are ultimate truth may be they are not. Thank you so much for responding. I totally agree with your recommendation to study category theory and model theory. These are the trees from the seeds they planted. Agree. May be they are the seeds may be they are the trees. Who knows what precedes what.... may be it transcends everything may be not as rule of excluded middle proves. But what will happen if ουσια partakes both, transcending everything including its own negation. To an uninitiated and naive as me this childish approach is what fascinates me. Thank you again for replying...
This is the most interesting way to teach someone about the TCSPs.. LOL
You should make clear why a (von Neumann) ordinal needs to be a transitive set (the fact that it should be well ordered (by the unique given relation in ZFC, the membership) is more clear, at least to me). Or simply claim first that all we need are well ordered sets (but there it comes the axiom of choice) and then add a unique well defined set (that is, an ordinal) order isomorphic to that well ordered set
Ich nehme gern eine Allmenge an, die ich definiere als jene Menge, die beliebige Elemente umfasst *und* die konsistent ist. Das ist für mich die eigentliche Allmenge bzw. „die ganze Welt“, denn ich möchte schon auf „das Ganze“ referieren oder darüber nachdenken können, ohne mich in Widersprüche zu verstricken, wie bei der Annahme von Russell‘s Allmenge. Könnte man das in ZFC so definieren o. ist ZFC mit FOL dafür zu ausdrucksarm?
Wenn man also das 9. Axiom wegnimmt, dann ist folgende selbstbezügliche Menge möglich: a = {a}? Wenn zB eine Menge M die Mengen a, b einschließt, dann gilt: M = a gdw. a = {a, b}? Damit könnte man nämlich M „von innen heraus“ vollständig beschreiben.
very interesting
Amazing! Thank you very much
Also, another question: in the proof, A and B are finite. What happens when it is not the case..?
The characterisation of A \in HSP(B) in terms of identities works even if A and B are infinite -- but the equivalence with A \in HSP^fin(B) breaks down.
@@bodirsky Thank you a lot for the answers to my questions! Would you know a reference for a proof of the theorem when A and B are infinite? I believe the original paper from Birkhoff (1935) only treats the finite case (and is hardly understandable nowadays..!)
@@emperorzurg7258 A reference that follows the presentation of the video but explicitly works also for infinite algebras is Theorem 6.5.1 in the recent book linked here tu-dresden.de/mn/math/algebra/bodirsky/die-professur/news/bucherscheinung?set_language=en or here wwwpub.zih.tu-dresden.de/~bodirsky/Book.pdf
@@bodirsky Thank you! I will read it someday.
I am sorry, but what is HSP^fin of B??
P^fin(B) stands for the *finite* powers of the algebra B
thank you so much, this is very helpful
At 12:24 did you mean the logical AND instead of the logical OR?
At 12:24 I cannot find a logical "or" -- perhaps you refer to the "union" symbol in (latex: T \cup F)? Here indeed the union is meant.
Fantastically clear, especially for someone not particularly versed in logic! thanks
Amazing video!
Very great video, thank you
Hello, professor. I came across your channel when I was searching for ways to understand concepts in logic, and I was very intrigued by the concepts that are introduced through your videos. I'm an undergraduate maths student, and I'm only studying through my second term, yet I do wish to study more advanced subjects. I was wondering if you could possibly introduce textbook resources for understanding and having an introduction to the subject of your videos and your field? Thank you very much.
Dear Reza Safdel - luckily, there are many excellent text books for model theory. The recent book of Tent and Ziegler is great, but perhaps rather for master students. I recommend to take a look at my course notes, on which the videos are based, since it is addressed to undergrad students: wwwpub.zih.tu-dresden.de/~bodirsky/Model-theory.pdf. More references to text books can be found there.
I like this book: Mathematical Logic from Joseph R. Shoenfield / Addison-Wesley It is a bit old 1967. For me it was the book to understand what is a Model of ZFC and the concept of forcing
Hi, lädst Du die ganze Serie hier hoch? Würde mich freuen!
Ja -- muss allerdings alles erst noch produziert werden!
Die Folgevideos zu diesem sind bereits auf dem Kanal! Herzliche Grüsse,
All you need is maths 💙
Ach das TBA hat wieder offen.
indeed
(Hopefully correct) Solution to the exercise at 5:08 : This is the classical „show all items with this property must lie in the closure, and that all these items already form a closed subset“-type situation. In the examination below I consider a „substructure“ to be given just by the base set and not the tuple (set, functions, relations), since the latter two are uniquely determined by A. It is easy to see that a subset can carry a substructure if and only if it is closed under function application on any tuple of elements. Let SS: P(B) → P(B) be the „substructure generated by“-Operation, which is of course monotone, extensive, and idempotent. Let further A := {t^\underline{B} (g1, …, gn) | gi \in G, t τ-term in n variables} as constructed. Note first that A actually extends G, since the term t(x_1) = x_1 is as a term function nothing but the identity, so every g in G is representable as t^\underline{A}(g). Furthermore, a simple inductionwe over the term-depth (the unique amount of steps we have to apply the inductive definition of a term to obtain a term t) shows that any substructure must be closed under the operation t^\underline{A} for any term t - roughly, because substructures have to be closed under function evaluation, and terms are just functions stacked in functions. In particular, if C is any substructure containing G, then C must contain A. Hence, A ⊂ SS(G) = \bigcup_{C substr. cont. G} C. On the other hand, A clearly is closed under all the functions, so it is a substructure. In terms of our closure operator, SS(A) = A. Combining the two, we get G ⊂ A, which by monotonicity becomes SS(G) ⊂ SS(A) = A , but A⊂ SS(G) as per the first observation. Hence, SS(G) = A, yielding the desired characterization.
This is correct!
Am I correct in observing that the correspondence (substructures ⇔ subsets whose injection is a homomorphism), which we know from universal algebra, fails to hold due to the differing demands on relations? For instance, the inclusion of a weak subgraph H≤G does preserve the “truth” of the relation, making it a homomorphism, but not its “falsity”, implying that H fails to be a substructure.
Yes, exactly!
Tischbouldern mit Querverstrebungen, an denen man sich abstützen kann, ist aber doch schummeln ;)
Nachmachen :)
Es waere schoen, wenn die Sprache nicht komplett auf dem linken Kanal liegen wuerde, sondern im Stereomix zentriert waere - mit Kopfhoerern ist das sonst recht anstrengend zuzuhoeren.
oh, guter Punkt, vielen Dank fuer den Hinweis!!
Aber wie lange müssen die Kastanien in den Ofen? Und bei wieviel Grad?
250 Grad -- bei der Dauer mache ich das immer nach Gefühl und Optik, aber sie brauchen eine gute Weile.