We will follow a short note by Artem Chernikov & Sergei Starchenko: "A note on the Erdos-Hajnal Conjecture." “In this short note we provide a relatively simple proof of the Erd ̋os–Hajnal conjecture for families of finite (hyper-)graphs without the m-order property. It was originally proved by M. Malliaris and S. Shelah”

We will present briefly the "multiverse view" of set theory, advocated by Hamkins, that there are a multitude of set-theoretic universes, and not one background universe, and his proposed "Multiverse Axioms". We will then move on to present the main result of Gitman and Hamkins in their paper "A natural model of the multiverse axioms" - that the countable computably saturated models of ZFC form a "toy model" of the multiverse axioms.

Keisler measures were introduced in the late 80's by Keisler but they became central objects in model theory only recently with the development of NIP theories. This led naturally to the question of whether there might be a parallel theory of measures in other tame classes, especially in the simple theories where pseudofinite counting measures supply natural and interesting examples. We will describe some first steps toward establishing such a theory, based on Keisler randomizations and the theory of independence for NSOP1 theories in continuous logic.

In an attempt to classify the geometries arising in strongly minimal sets, Zil'ber conjectured them to split into three different types: Trivial geometries, vector space-like geometries and field-like geometries. Soon after, Hrushovski refuted this conjecture while introducing a new construction method, which has been modified and used a lot ever since.

We shall try to prove some surprising (and hopefully, correct) theorems about the relationship between the club principle (Hebrew: tiltan) and the splitting number, with respect to the classical s at omega and the generalized s at supercompact cardinals.

Better lucky than smart: realizing a quasi-generic class of measure preserving transformations as diffeomorphisms. Speaker: Matthew Foreman Abstract: In 1932, von Neumann proposed classifying measure preserving diffeomorphisms up to measure isomorphism. Joint work with B. Weiss shows this is impossible in the sense that the corresponding equivalence relation is not Borel; hence impossible to capture using countable methods.

Reflections on the coloring and chromatic numbers Speaker: Chris Lambie-Hanson Abstract: Compactness phenomena play a central role in modern set theory, and the investigation of compactness and incompactness for the coloring and chromatic numbers of graphs has been a thriving area of research since the mid-20th century, when De Bruijn and Erdős published their compactness theorem for finite chromatic

In [Sh771] Shelah rediscovered an old result of Dudley on the non-admissibility of a Polish group topology on an uncountable free group. Crucial to his proof is a so-called Compactness Lemma for Polish groups, concerning satisfaction of algebraic equations for certain sequences of group elements converging to 0 (in distance).

We shall prove that there is a sequence of Boolean algebras for which the ultraproduct of the lengths divided by an ultrafilter is strictly less than the length of the product algebra. This is a joint work with Saharon Shelah.

The family of high rank arithmetic groups is a class of groups playing an important role in various areas of mathematics. It includes SL(n,Z), for n>2 , SL(n, Z[1/p] ) for n>1, their finite index subgroups and many more. A number of remarkable results about them have been proven including; Mostow rigidity, Margulis Super rigidity and the Quasi-isometric rigidity.

Weak Prediction Principles Speaker: Yair Hayut Abstract: Jensen's diamond is a well studied prediction principle. It holds in L (and other core models), and in many cases it follows from local instances of GCH. In the talk I will address a weakening of diamond (due to Shaleh and Abraham) and present Abraham's theorem about the equivalence between weak diamond and a weak consequence of GCH. Abraham's argument works for successor cardinals. I will discuss what is known and what is open for inaccessible cardinals. This is a joint work with Shimon Garti and Omer Ben-Neria.

Speaker: Elad Levi Algebraic regularity lemma for hypergraphs Abstract: Szemer´edi’s Regularity Lemma is a fundamental tool in graph theory. It states that for every large enough graph, the set of vertices has a partition A1,..,Ak, such that for almost every two subsets Ai,Aj the induced bipartite graph on (Ai,Aj) is regular, i.e. similar to a random bipartite graph up to a given error.

Arbault sets (briefly, A-sets) were first introduced by Jean Arbault in the context of Fourier analysis. One of his major results concerning these sets,asserts that the union of an A-set with a countable set is again an A-set. The next obvious step is to ask what happens if we replace the word "countable" by א_1. Apparently, an א_1 version of Arbault's theorem is independent of ZFC. The aim of this talk would be to give a proof (as detailed as possible) of this independence result. The main ingredients of the proof are infinite combinatorics and some very basic Fourier analysis.

This talk will be largely based on a paper by Joseph Shipman with the same title. We will discuss some variations of Fubini type theorems. The focus will be on what is known as "strong Fubini type theorems". Apparently these versions were proved to be independent of ZFC,and our main aim will be to sketch a proof of this result. We will assume basic knowledge in measure theory. Aside from that, the material is rather self contained.