added abstract and video links

Author: root

_posts/2022-02-25-big-classes-and-the-respected-model.html

@@ -15,7 +15,7 @@
 As part of this, we shall see a failed attempt to find a proper class which is not big in the theory ZF without Power Set but with Collection - which is by taking a certain symmetric submodel of a class forcing. It will turn out that this approach fails because, unlike in the set forcing case, the symmetric submodel of a class forcing need not exhibit many of the nice properties that we would expect. Notably, Collection may fail and, in fact, it is unclear which axioms need necessarily hold. </p>
 <p>
 This will lead to the definition of the 'Respected Model', an alternative approach to defining a submodel of a class forcing in which Choice fails. We will investigate the properties of this new model and compare it to the symmetric version.</p>
-<p><strong><a href=''>Video</a></strong></p>
+<p><strong><a href='https://www.youtube.com/watch?v=8BvMd6ARZqY'>Video</a></strong></p>
 "
 excerpt_separator: <!--more-->
 talk: yes

_posts/2022-03-04-subforcings-of-the-tree-prikry-forcing.html

@@ -18,7 +18,7 @@
 <a href='/files/BenhamouSlides032022.pdf'><strong>Slides</strong></a>
 </p>
 <p>
-<a href=''><strong>Video</strong></a>
+<a href='https://www.youtube.com/watch?v=6qvB2Y0JV-w'><strong>Video</strong></a>
 </p>"
 excerpt_separator: <!--more-->
 talk: yes

_posts/2022-03-29-a-survey-on-the-automorphism-groups-of-countable-recursively-saturated-models-of-pa.html

@@ -12,7 +12,7 @@
 abstract: "
 <p>In this talk we discuss important results concerning the automorphism groups of countable recursively saturated models of PA and automorphism groups of the countable boundedly recursively saturated models of PA which are short (aka short recursively saturated models). We compare and contrast and also list some open questions.
 </p>
-<p><strong><a href=''>Video</a></strong></p>
+<p><strong><a href='https://www.youtube.com/watch?v=G_kRnFHfeeA'>Video</a></strong></p>
  ​"
 excerpt_separator: <!--more-->
 talk: yes

_posts/2022-04-22-stationary-logic-and-set-theory.html

@@ -10,7 +10,9 @@
 speaker_website: "http://www.math.helsinki.fi/logic/people/jouko.vaananen/"
 affiliation: University of Helsinki
 abstract: "
-
+<p>
+Stationary logic was introduced in the 1970’s. It allows the quantifier 'for almost all countable subsets s…'. Although it is undoubtedly a kind of second order logic, it is completely axiomatizable, countably compact and satisfies a kind of Downward Lowenheim-Skolem theorem. In this talk I give first a general introduction to the extension of first order logic by this 'almost all'-quantifier. As 'almost all' is interpreted as 'for a club of', the theory of this logic is entangled with properties of stationary sets. I will give some examples of this. The main reason to focus on this logic in my talk is to use it to build an inner model of set theory. I will give a general introduction to this inner model, called C(aa), or the aa-model, and sketch a proof of CH in the model. My work on the aa-model is joint work with Juliette Kennedy and Menachem Magidor.
+</p>
 
  ​"
 excerpt_separator: <!--more-->