The Halpern-Läuchli theorem was first introduced for its use in Halpern and Lévy's proof of BPI in the Cohen model. Since then, several other theorems establish emergent connections between variants of the Halpern-Läuchli Theorem and BPI in certain symmetric extensions. In this talk, we develop the forcing perspective given by Harrington's proof of the Halpern-Läuchli Theorem. By doing so, we will more clearly identify a connection between variants of the Halpern-Läuchli Theorem and the existence of certain filters in symmetric extensions. Using tools from the study of BPI in symmetric extensions, we use this connection to give simple positive and negative proofs of new variants of the Halpern-Läuchli Theorem.
For an infinite cardinal κ, the ultrafilter number u_κ is the smallest size of a family that generates a uniform ultrafilter on κ. We say that u_κ is bounded if u_κ<2^κ.
The case κ=ω is well understood, with the consistency of a bounded ultrafilter number at ω first noted in the early 1970s by Kunen. The method used in Kunen’s construction does not generalize to the case κ=ω_1, and Kunen asked whether u_{ω_1}<2^{ω_1} is even consistent; this remains wide open.
The consistency of u_κ<2^κ for general uncountable κ has been studied extensively in the last decade. In this series of talks, we will survey some recent progress towards bounding the ultrafilter number at successor values of κ, with emphasis on a key theorem of Raghavan and Shelah. We will also discuss some crucial limitations to applying this theorem for a bounded ultrafilter number at any of the ω_n’s.
For an infinite cardinal κ, the ultrafilter number u_κ is the smallest size of a family that generates a uniform ultrafilter on κ. We say that u_κ is bounded if u_κ<2^κ.
The case κ=ω is well understood, with the consistency of a bounded ultrafilter number at ω first noted in the early 1970s by Kunen. The method used in Kunen’s construction does not generalize to the case κ=ω_1, and Kunen asked whether u_{ω_1}<2^{ω_1} is even consistent; this remains wide open.
The consistency of u_κ<2^κ for general uncountable κ has been studied extensively in the last decade. In this series of talks, we will survey some recent progress towards bounding the ultrafilter number at successor values of κ, with emphasis on a key theorem of Raghavan and Shelah. We will also discuss some crucial limitations to applying this theorem for a bounded ultrafilter number at any of the ω_n’s.
For an infinite cardinal κ, the ultrafilter number u_κ is the smallest size of a family that generates a uniform ultrafilter on κ. We say that u_κ is bounded if u_κ<2^κ.
The case κ=ω is well understood, with the consistency of a bounded ultrafilter number at $\omega$ first noted in the early 1970s by Kunen. The method used in Kunen’s construction does not generalize to the case κ=ω_1, and Kunen asked whether u_{ω_1}<2^{ω_1} is even consistent; this remains wide open.
The consistency of u_κ<2^κ for general uncountable κ has been studied extensively in the last decade. In this series of talks, we will survey some recent progress towards bounding the ultrafilter number at successor values of κ, with emphasis on a key theorem of Raghavan and Shelah. We will also discuss some crucial limitations to applying this theorem for a bounded ultrafilter number at any of the ω_n’s.
We survey recent work on the Sealing phenomenon. Woodin shows that various forms of Sealing hold in a generic extension of the universe of sets in which there is a supercompact cardinal and a proper class of Woodin cardinals. Sargsyan and I study Sealing in hod mice and compute the exact consistency strength of Sealing. I will give background and state precisely these results. I will also discuss the impact of Sealing on the universe of sets and the inner model program.
This talk analyses when different generics for a given poset yield the same extension gives rise to countable Borel equivalence relations. We characterize when these relations are smooth. We also explore Prikry and Cohen forcing. This is joint work with Filippo Calderoni.
I will introduce the notion of “Ramsey partition regularity,” a generalization of partition regularity involving infinite configurations. This notion is characterized in terms of certain ultrafilters related to tensor products, and called Ramsey witnesses. We use the properties of this characterization in the nonstandard context of hypernatural numbers to determine whether various patterns involving polynomials and exponentials are Ramsey partition regular.
(Joint work with L. Luperi Baglini, M. Mamino, R. Mennuni, and M. Ragosta.)
Quasiminimal classes form an abstract analogue of strongly minimal theories. Following what can be done in the strongly minimal case, we consider two expansions of quasiminimal classes with a unary predicate: beautiful pairs and H-structures. We show each of these expansions can be axiomatized with a single Lω1ω (Q)-sentence and that both expansions are ω-stable. We will explain why these expansions are natural in the strongly minimal context and how to extrapolate some results to the new setting. Conversely, we show how to produce new examples of quasiminimal classes using beautiful pairs.
We will define L_1 Banach lattices and recall some of its model theoretic properties. We will then consider group algebras associated to locally compact groups, where the multiplication is convolution and we will consider them as L_1 Banach lattices. We will show that such expansions carry deep information about the underlying group. For example, when the group is discrete, the group will be definable inside the expansion. In particular, we show, for discrete groups, that if two group algebras are elementary equivalent, then the corresponding groups are elementary equivalent.
Historically, proofs of the Boolean Prime Ideal Theorem (BPI) in choiceless models of ZF have taken considerable effort. We present a new conceptual framework with which to prove BPI in choiceless models, based on Harrington's proof of the Halpern-Läuchli theorem. This allows for new proofs of several results from the literature, including the fact that ZF+BPI cannot prove the axiom of choice. We describe these results and the connection to the Halpern-Läuchli theorem that is implicit in this approach.