Abstract: I will explain the model theoretic notion of ampleness and present the geometric context of recent constructions.

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.

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

The modal logic of σ-centered forcing Speaker: Ur Benari-Tish

In my master thesis we (Prof' Kobi Peterzil and I) investigated a problem in combinatorial geometry using tools from model theory. Following the article of Chernikov and Starchenko, "Regularity lemma for distal structures", we consider the Strong Erdos-Hajnal property for the incidence relation of points and lines in R^2. In particular, we compute a constant d such that for every finite sets of points P and lines L, with |P|,|L| > 2, there are a subsets P' of P and L' of L such that no point in P' lies on a line from L', and such that |P'|>d|P| , |L'|>d|L|.

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.

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.

Abstract: We will discuss the main steps in the proof of the theorem stating that if (G,+, ...) is a strongly minimal expansion of a group interpretable in an o-minimal expansion of a field, and \dim(G)=2 then G is a pure algebraic group. Joint work with P. Eleftheriou and Y. Peterzil.

Abstract: We continue with the topic of the previous week. We will define the Radin forcing, discuss (without proof) and its basic properties. We will give Woodin's proof for the consistency of the existence of strong inaccessible without diamond and show how to strengthen it to the consistency of strong inaccessible without weak diamond.

Sela proved that the theory of free groups is stable. It is thus natural to wonder what the independence relation looks like. Together with Sklinos, we worked out a complete characterization of forking independence in the standard model (over any set of parameters) in terms of an algebraic-geometric object called the JSJ decomposition, which encodes all the splittings of the group as an amalgamated product or an HNN extension relative to the parameter set. In the talk we will try to give an idea of the proof over some examples.

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.

We isolate the property of being a critical point, and prove some basic positive properties of them. We will also prove a lifting property that allows lifting elementary embedding to symmetric extensions, and outline a construction that shows that it is consistent that a successor of a critical cardinal is singular. This is a recent work with Yair Hayut.

Abstract: The notion of an ascent path through a tree, isolated by Laver, is a generalization of the notion of a cofinal branch and, in many cases, the existence of an ascent path through a tree provides a concrete obstruction to the tree being special. We will discuss some recent results regarding ascent paths through kappa-trees, where kappa > omega_1 is a regular cardinal. We will discuss the consistency of the existence or non-existence of a special mu^+-tree with a cf(mu)-ascent path, where mu is a singular cardinal.

Abstract: The set theoretic generalizations of algebras have been introduced in the 1960s to give a set theoretic interpretation of usual algebraic structures. The shift in perspective from algebra to set theory is that in set theory the focus is on the collection of possible algebras and sub-algebras on specific cardinals rather than on particular algebraic structures. The study of collections of algebras and sub-algebras has generated many well-known problems in combinatorial set theory (e.g., Chang’s conjecture and the existence of small singular Jonsson cardinals).

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”