Introduction to measurable cardinals and L II

Speaker: 

Ryan Sullivant

Institution: 

UCI

Time: 

Monday, February 26, 2018 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

In this talk, we will continue with basics of measurable cardinals and their relationship to non-trivial elementary embeddings.  We proceed with basic facts about the constructible universe, L.  After laying this groundwork, we show L cannot have a measurable cardinal.  Time permitting, we will discuss the dichotomy introduced by Jensen's covering lemma: either L is a good approximation to V, or there is a non-trivial elementary embedding from L to L.

The complexity of countable torsion-free Abelian groups

Speaker: 

Douglas Ulrich

Institution: 

University of Maryland

Time: 

Monday, May 7, 2018 - 4:00pm

Host: 

Location: 

RH 440R

How complicated are countable torsion-free abelian groups? In particular, are they as complicated as countable graphs? In recent joint work with Shelah, we show it is consistent with ZFC that countable torsion-free abelian groups are $a \Delta^1_2$ complete; in other words, countable graphs can be encoded into them via an absolutely $\Delta^1_2$-map. I discuss this, and the related result: assuming large cardinals, it is independent of ZFC if there is an absolutely $\Delta^1_2$ reduction from Graphs to Colored Trees, which takes non-isomorphic graphs to non-biembeddable colored trees.

Coding along trees and remarkable cardinals

Speaker: 

Zach Norwood

Institution: 

UCLA

Time: 

Monday, February 12, 2018 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

A major project in set theory aims to explore the connection between large cardinals and so-called generic absoluteness principles, which assert that forcing notions from a certain class cannot change the truth value of (projective, for instance) statements about the real numbers. For example, in the 80s Kunen showed that absoluteness to ccc forcing extensions is equiconsistent with a weakly compact cardinal. More recently, Schindler showed that absoluteness to proper forcing extensions is equiconsistent with a remarkable cardinal. (Remarkable cardinals will be defined in the talk.) Schindler's proof does not resemble Kunen's, however, using almost-disjoint coding instead of Kunen's innovative method of coding along branchless trees. We show how to reconcile these two proofs, giving a new proof of Schindler's theorem that generalizes Kunen's methods and suggests further investigation of non-thin trees.

Learning seminar: An introduction to large cardinals and L

Speaker: 

Ryan Sullivant

Institution: 

UCI

Time: 

Monday, February 5, 2018 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

In this talk, we will cover the basics of measurable cardinals and their relationship to non-trivial elementary embeddings.  We proceed with basic facts about the constructible universe, L.  After laying this groundwork, we show L cannot have a measurable cardinal.  Time permitting, we will discuss the dichotomy introduced by Jensen's covering lemma: either L is a good approximation to V, or there is a non-trivial elementary embedding from L to L.

 

Models of the axiom of determinacy and their generic extensions

Speaker: 

Nam Trang

Institution: 

UCI

Time: 

Monday, January 22, 2018 - 4:00am to 5:30am

Host: 

Location: 

RH 440R

Forcing and elementary embeddings are central topics in set theory. Most of what set theorists have focused on are the study of forcing and elementary embeddings over models of ZFC. In this talk, we focus on forcing and elementary embeddings over models of the Axiom of Determinacy (AD). In particular, we focus on answering the following questions: work in V which models AD. Let P be a forcing poset and g ⊆ P be V -generic.

1) Does V [g] model AD?

2) Is there an elementary embedding from V to V [g]?

Regarding question 1, we want to classify what forcings preserve AD. We show that forcings that add Cohen reals, random reals, and many other well-known forcings do not preserve AD. Regarding question 2, an analogous statement to the famous Kunen’s theorem for models of ZFC, can be shown: suppose V = L(X) for some set X and V models AD, then there is no elementary embedding from V to itself. We conjecture that there are no elementary embeddings from V to itself. We present some of the results discussed above. There is still much work to do to completely answer questions 1 and 2. This is an ongoing joint work with D. Ikegami.

 

Semiproperness of nonreasonable posets

Speaker: 

Sean Cox

Institution: 

Virginia Commonwealth University

Time: 

Monday, January 8, 2018 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

Shelah proved that a certain form of Strong Chang’s Conjecture is equivalent to the  statement ``Namba forcing is semiproper". I will present some related results about semiproperness of ``nonreasonable” posets (a notion introduced by Foreman-Magidor). This is joint work with Hiroshi Sakai.

A Step Back from Forcing

Speaker: 

Toby Meadows

Institution: 

University of Queensland

Time: 

Monday, November 27, 2017 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

In this talk, I’ll sketch a way of unifying a wide variety of set theoretic approaches for generating new models from old models. The underlying methodology will draw from techniques in Sheaf Theory and the theory of Boolean Ultrapowers.

 

Algebraic properties of elementary embeddings

Speaker: 

Scott Cramer

Institution: 

California State University San Bernardino

Time: 

Monday, December 4, 2017 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

We will investigate algebraic structures created by rank-into-rank elementary embeddings. Our starting point will be R. Laver's theorem that any rank-into-rank embedding generates a free left-distributive algebra on one generator. We will consider extensions of this and related results. Our results will lead to some surprisingly coherent conjectures on the algebraic structure of rank-into-rank embeddings in general.

From Spaces to Scales to Ordinals

Speaker: 

Jeffrey Bergfalk

Institution: 

Cornell University

Time: 

Monday, October 16, 2017 - 4:00pm to 5:50pm

Host: 

Location: 

RH 440R

We describe a number of related questions at the interface of set theory and homology theory, centering on (1) the additivity of strong homology, and (2) the cohomology of the ordinals. In the first, the question is, at heart: To how general a category of topological spaces may classical homology theory be continuously extended? And in the tension between various potential senses of continuity lie a number of delicate set-theoretic questions. These questions led to the consideration of the Cech cohomology of the ordinals; the surprise was that this is a meaningful thing to consider at all. It very much is, describing or suggesting at once (i) distinctive combinatorial principles associated to the nth infinite cardinal, for each n, holding in ZFC, (ii) rich connections between cofinality and dimension, and (iii) higher-dimensional extensions of the method of minimal walks.

Pages

Subscribe to RSS - Logic Set Theory