The announcements are updated continuously. For a list of talks in the coming weeks, please see here.
Carnegie Mellon University Logic Seminar
Time: Tuesday, 11 February, 4:00 – 5:00pm Pittsburgh time (22:00 – 23:00 CET)
Speaker: Clinton Conley, CMU
Title: Quasi-invariant measures concentrating on countable structures
Abstract: Countable structures whose isomorphism class supports a permutation invariant probability measure have been characterized by Ackerman-Freer-Patel as those with no algebraicity. We provide an analogous model-theoretic characterization of countable structures whose isomorphism class supports a quasi-invariant probability measure. This is joint work with Colin Jahel and Aristotelis Panagiotopoulos.
Information: See the seminar webpage.
Hebrew University Set Theory Seminar
Time: Wednesday, 12 February, 13:00-15:00 local time (12:00-14:00 CEST)
Speaker: Yair Hayut
Title: Tukey types of ultrafilters on omega (part 2)
Abstract: Using iteration of Mathias-like forcings, Kunen showed that consistently there is an ultrafilter on omega with generating set of order type an uncountable regular cardinal
, even when the continuum is much larger than
.
As the cofinal types of an ultrafilter (the Tukey-type) is not necessarily a cardinal, it is natural to ask which cofinal types of directed partial orders can indeed be the Tukey type of ultrafilters on omega (or generally, kappa-closed ultrafilters on kappa).
In this talk, I will present a joint work with Tom Benhamou, James Cummings, Gabe Goldberg and Alejandro Poveda, in which we show the consistency of the existence of an ultrafilter on
in which there is a cofinal set (mod bounded error) of order type
(the product order). I will discuss some of the limitations of the method.
Information: This talk will be given in hybrid format. Please contact Omer Ben-Neria and Inbar Oren for the login information.
Leeds Set Theory Seminar
Time: Wednesday, 12 February, 11:00-12:00 local time (12:00-13:00 CET)
Speaker: Calliope Ryan-Smith
Title: An exact menagerie
Abstract: An exact linear order is one with no non-trivial self-embedding. I shall talk a little bit about these objects and some questions of interest surrounding them, taking us on a path through Ramsey constructions and curious questions in abstract forcing.
Information: Contact Hope Duncan at mmhid@leeds.ac.uk for more information.
Caltech Logic Seminar
Time: Wednesday, 12 February, 12:00 – 13:00pm Pacific time (21:00 – 22:00 CET)
Speaker: Alex Kastner, UCLA
Title: Σ12-completeness results in Borel combinatorics via gadget reductions
Abstract: In 2021, Todorčević and Vidnyánszky proved that the problem of deciding whether a locally finite Borel graph has a proper Borel 3-coloring is Σ12-complete. Building off of an argument of Thornton, we discuss how the polynomial-time gadget reductions used to establish NP-completeness can often be turned into Borel reductions to establish Σ12-completeness results in Borel combinatorics.
Information: See the seminar webpage.
Baltic Set Theory Seminar
Time: Thursday, 13 February, 16:30 – 18:00 CET
Speaker: Grigor Sargsyan
Title: Dense ideals
Abstract: The aim of this seminar series is to present topics that are of current interest. The material is usually built from ground up making it accessible to a wider audience than just experts. Feel free to participate at any time.
The topic of this semester’s seminar is based on a joint NCN-FWF project by Monroe Eskew and Grigor Sargsyan. The aim is to study dense ideals, and Sargsyan’s part of the project involves forcing over models of determinacy. The starting point of this construction is Woodin’s theorem that, given V is a model of Θreg+V=L(P(R)), the poset Coll(ω1,R)∗A˙dd(1,ω2) forces the existence of an ω1-dense ideal on ω1. The aim of this lecture is to present the proof of this theorem. We will start slowly and cover the background material that leads to the proof. There are two documents that contain the proof.
– Forcing a dense ideal on ω1 over a model of determinacy by Obrad Kasum
– Ideals and Strong Axioms of Determinacy by Dominik Adolf, Grigor Sargsyan, Nam Trang, Trevor Wilson, Martin Zeman
Information: This talk will be given in hybrid format. Please contact Rahman Mohammadpour and Grigor Sargsyan for information how to participate.
New York Set Theory Seminar
Time: Friday, 14 February, 11.00 New York time (17.00 CET)
Speaker: Ali Enayat, University of Gothenburg
Title: Models of set theory: extensions and dead-ends part II
Abstract: This is a two-part talk concerning existence/non-existence of certain kinds of extensions of arbitrary models of ZF, with no regard to countability or well-foundedness of the models involved. The talk is based a recent preprint: arXiv:2406.14790v1. The results presented include the following two. In Theorem A below, N is said to be a conservative elementary extension of M if N is an elementary extension of M with the property that the intersection of every parametrically definable subset of N with M is parametrically definable in M.
Theorem A. Every model M of ZF with a definable global well-ordering has a conservative elementary extension N that contains an ordinal above all of the ordinals of M.
Theorem B. Every consistent extension of ZF has a model of power aleph_1 that has no end extension to a model of ZF.
Information: Please see the seminar webpage for the login information.
Toronto Set Theory Seminar
Time: Friday, 14 February, 1.30-3.00pm Toronto time (19.30-21.00 CET)
Speaker: Shaun Allison, University of Toronto
Title: tba
Abstract: tba
Information: Please see the seminar webpage for the login information.
New York Logic Workshop
Time: Friday, 14 February, 14.00 New York time (20.00 CET)
Speaker: Assaf Shani, Concordia University
Title: Generic dichotomies for Borel homomorphisms for the finite Friedman-Stanley jumps
Abstract: The talk will begin by discussing the basic definitions and general goals behind the theory of Borel equivalence relations. We focus on the Friedman-Stanley jumps =+n, for n=1,2,… and n=ω. These Borel equivalence relations represent the notions of being classifiable using invariants which are countable sets of reals, countable sets of countable sets of reals, and so on. We consider the problem of constructing a Borel reduction from =+n to some other equivalence relation.
For n=1 the situation is well understood and there are many such results. For example: Marker proved that for a first order theory with an uncountable type space, its isomorphism relation is above =+1; Larson and Zapletal characterized the analytic equivalence relations above =+1 as those which are ‘unpinned’ in the Solovay extension.
In this talk we present a new technique for proving that an equivalence relation is above =+n, when n>1, based on Baire-category methods. As corollaries, we conclude that =+ω is ‘regular’ (answering a question of Clemens), and that =+n is ‘in the spectrum of the meager ideal’ (extending a result of Kanovei, Sabok, and Zapletal for n=1).
Information: Please see the seminar webpage for the login information.