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
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.
This talk is about three published papers of mine that form my phd. In the first two chapters I focus in the model theory of real closed fields and in the third one I take one step back and investigate in greater genearility dependent theories.
The results are the following:
1. Boundedness criterion for rational functions over generalized semi-algebraic sets in real closed fields.
2. Positivity criterion for polynomials over generalized semi-algebraic sets in real closed valued fields.
A special class among the countably infinite relational structures is the class of homogeneous structures. These are the structures where every finite partial isomorphism extends to a total automorphism. A countable set, the ordered rationals, and the random graph are all homogeneous.
Non-equational stable groups.
Speaker: Rizos Sklinos
Abstract: The notion of equationality has been introduced by Srour and further
developed by Pillay-Srour. It is best understood intuitively as a notion
of Noetherianity on instances of first-order formulas. A first-order
theory is equational when every first-order formula is equivalent to a
boolean combination of equations.
Equationality implies stability and for many years these two notions were
identified, as only an "artificial" example of Hrushovski (a tweaked
pseudo-space) was witnessing otherwise. Recently Sela proved that the
Zilber introduced quasi-minimal classes to generalize the model theory of pseudo exponential
fields. They are equipped with a pregeometry operator and satisfy interesting properties such
as having only countable or co-countable definable sets. Differentially closed fields of
characteristic 0, rich examples of a \omega-stable structures, are good candidates to be
quasiminimal. The difficulty is that a differential equation may have uncountably many
solutions, and thus violate the countable closure requirement of quasiminimal structures.
Chang's Conjecture is a strengthening of Lowenheim-Skolem-Tarski theorem. While Lowenheim-Skolem-Tarski theorem is provable in ZFC, any instance of Chang's Conjecture is independent with ZFC and has nontrivial consistency strength. Thus, the question of how many instances of Chang's Conjecture can consistently hold simultaneously is natural.
I will talk about some classical results on the impossibility of some instances of Chang's Conjecture and present some results from a joint work with Monroe Eskew.
First speaker: Daniel kalmanovich, HU
Title: On the face numbers of cubical polytopes
Understanding the possible face numbers of polytopes, and of subfamilies of interest, is a fundamental question.
The celebrated g-theorem, conjectured by McMullen in 1971 and proved by Stanley (necessity) and by Billera and Lee (sufficiency) in 1980-81, characterizes the f-vectors of simplicial polytopes.