In the prequel I sketched a proof of how determinacy hypotheses could imply the measurability of both and inside . The latter is really the first step in showing the *much* stronger assertion that is Woodin. I’ll here sketch what main ideas are involved in the proof of this fact.

# What is K?

The *core model* K is, among other things, great for providing lower bounds for the consistency strength of some interesting theory. For instance, every Jónsson cardinal is Ramsey in K, showing that the two are equiconsistent. Usually there are a lot of *different* K’s with different properties, sometimes denoted by things like , or something along those lines. This is my attempt at (briefly) explaining what K is, and what the differences between the various versions are. Here’s an overview of the various core models I’ll cover:

# From Determinacy to a Woodin I

In my previous posts I provided a sketch of how a measurable above a limit of Woodins implies that holds in . The “converse”, saying that implies that there is a model with infinitely many Woodin cardinals, is a lot more complicated. I will try to simplify a lot of these complications here, to give an idea of what is going on. I will only focus on showing the existence of a single Woodin (for now), where the Woodin in question will be inside of . As always, I will be very sketchy in this blog post, but provide more details in my note.

# Hahn-Banach sans Zorn

The *Hahn-Banach* *Theorem* in functional analysis is the theorem saying more or less that normed vector spaces have many bounded linear functionals. The theorem is usually proven via Zorn’s lemma, giving the impression that Hahn-Banach uses the full power of choice. I’ll here give a proof based on the *ultrafilter lemma*, that every filter can be extended to an ultrafilter. One of the benefits of this approach, besides relying on a (strictly) weaker assumption, is that we get a little more information about how the functionals are constructed. The idea is that the ultrafilters allow us to “glue” functionals together. A latex’ed version can be found here.

# Choiceless non-free algebras

This post is a bit different, as it’s somewhat more of a curiosity I recently noticed. It’s a theorem of that every type of of algebraic structure has a *free* algebra, similar to the notion of a free group, free module and so on. How about without choice? It turns out that the theory

has considerable consistency strength. It consistency-wise implies and is consistency-wise implied by a proper class of strongly compacts.

# Determinacy from Woodins III – AD in L(R)

This is the third post in my series on determinacy from Woodins. In the last post we showed Martin-Steel’s result that follows from the existence of infinitely many Woodins and a measurable above. We’ll now give the main ideas of Woodin’s incredible strengthening of this result, showing from the same assumption that holds.

# Determinacy from Woodins II

This is a continuation of my last post on determinacy, where we began the proof of projective determinacy. We’ve reduced the statement to showing that every projective set is homogeneously Suslin, which will be shown here, modulo a key lemma from [MS89].