The 15th SLALM (Latin American Symposium in Mathematical Logic) was held in Bogotá, June 4-8, 2012. There were also three tutorials preceding the main event, on May 30-June 2. I give one of the tutorials, on Determinacy and Inner model theory, 10:40-12 each day, at the Universidad Nacional. Here is the abstract:

Since the invention of forcing, we know of many statements that are independent of the usual axioms of set theory, and even more that we know are consistent with the axioms (but we do not yet know whether they are actually provable).

These proofs of consistency typically make use of large cardinal assumptions. Inner model theory is the most powerful technique we have developed to analyze the structure of large cardinals. It also allows us to show that the use of large cardinals is in many cases indispensable. For years, the main tool in the development of this area was fine structure theory.

Determinacy (in suitable inner models) is a consequence of large cardinals, and recent work has revealed deep interconnections between determinacy assumptions and the existence of inner models with large cardinals, thus showing that descriptive set theory is also a key tool.

The development of these connections started in earnest with Woodin’s core model induction technique, and has led to what we now call Descriptive inner model theory.

The goal of the mini-course is to give a rough overview of these developments.

I have written a set of notes based on these talks, and will be making it available soon.

In addition, I gave one of the invited talks during the set theory session: Forcing with over models of strong versions of determinacy. Here is the abstract:

Hugh Woodin introduced , a definable poset, and showed that, when forcing with it over (in the presence of determinacy), one recovers choice, and obtains a model of many combinatorial assertions for which simultaneous consistency was not known by traditional forcing techniques. can be applied to larger models of determinacy. As part of joint work with Larson, Sargsyan, Schindler, Steel, and Zeman, we show how this allows us to calibrate the strength of different square principles.

In particular, Woodin showed that, starting with a model of “ is regular”, a strong form of determinacy, the extension satisfies , the restriction of Martin’s maximum to posets of size at most . It is natural to wonder to what extent this can be extended. In this paper, we study the effect of on square principles, centering on those that would be decided by .

These square principles are combinatorial statements stating that a specific version of compactness fails in the universe, namely, there is a certain tree without branches. They were introduced by Ronald Jensen in his paper on The fine structure of the constructible universe. The most well known is the principle :

Definition. Given a cardinal , the principle holds iff there exists a sequence such that for each ,

Each is club in ;

For each limit point of , ; and

The order type of each is at most .

For this is true, but uninteresting. The principle holds in Gödel’s , for all uncountable . It is consistent, relative to a supercompact cardinal, that it fails for all uncountable . For example, this is a consequence of Martin’s maximum.

Recently, the principle has been receiving some attention.

Definition. Given an ordinal , the principle holds iff there exists a sequence such that

For each , each is club in ;

For each , and each limit point of , ; and

There is no thread through the sequence, i.e., there is no club such that for each limit point of .

Using the Core Model Induction technique developed by Woodin, work of Ernest Schimmerling, extended by Steel, has shown that the statement

implies that determinacy holds in , and the known upper bounds in consistency strength are much higher.

Here are some of our results: First, if one wants to obtain in a extension, one needs to start from a reasonably strong determinacy assumption:

Theorem.Assume “ is regular”, and that there is no such that “ is Mahlo in “. Then holds in the extension.

This results uses a blend of fine structure theory with the techniques developed by Sargsyan on his work on hybrid mice. The assumption cannot be improved since we also have the following, the hypothesis of which are a consequence of “ is Mahlo in ”.

Theorem.Assume that holds and that is a limit on the Solovay sequence such that that there are cofinally many that are limits of the Solovay sequence and are regular in . Then fails in the extension of .

Here, denotes the collection of subsets of of Wadge rank less than . The Solovay sequence, introduced by Robert Solovay in The independence of from , is a refinement of the definition of , the least ordinal for which there is no surjection :

Definition. The Solovay sequence if the sequence of ordinals such that

is the least ordinal that is not the surjective image of the reals by an ordinal definable function;

For each , is the least ordinal that is not the surjective image of the reals by a function definable from an ordinal and a set of reals of Wadge rank ;

For each limit ordinal , ; and

.

The problem with the result just stated is that choice fails in the resulting model. To remedy this, we need to start with stronger assumptions. Still, these assumptions greatly improve the previous upper bounds for the consistency (with ) of . In particular, we now know that this theory is strictly weaker than a Woodin limit of Woodin cardinals.

Theorem.Assume that holds, that , and that stationarily many elements of cofinality in the Solovay sequence are regular in . Then in the -extension, fails.

(The forcing adds a Cohen subset of . This suffices to well-order , and therefore to force choice. That in the resulting model we also have follows from prior work of Woodin.)

Finally, I think I should mention a bit of notation. In the paper, we say that is square inaccessible iff fails. We also say that is threadable iff fails. This serves to put the emphasis on the negations of the square principles, which we feel is where the interest resides. It also solves the slight notational inconvenience of calling a principle that is actually a statement about .

As mentioned before, I asked my 305 students to write a short paper as a final project. I am posting them here, with their permission; it is my hope that people will find them useful. There are some very nice papers here.

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

I assume by $\aleph$ you mean $\mathfrak c$, the cardinality of the continuum. You can build $D$ by transfinite recursion: Well-order the continuum in type $\mathfrak c$. At stage $\alpha$ you add a point of $A_\alpha$ to your set, and one to its complement. You can always do this because at each stage fewer than $\mathfrak c$ many points have been selected. […]

Stefan, "low" cardinalities do not change by passing from $L({\mathbb R})$ to $L({\mathbb R})[{\mathcal U}]$, so the answer to the second question is negative. More precisely: Assume determinacy in $L({\mathbb R})$. Then $2^\omega/E_0$ is a successor cardinal to ${\mathfrak c}$ (This doesn't matter, all we need is that it is strictly larger. T […]

A simple example is the permutation $\pi$ given by $\pi(n)=n+2$ if $n$ is even, $\pi(1)=0$, and otherwise $\pi(n)=n−2$. It should be clear that $\pi$ is computable and has the desired property. By the way, regarding the footnote: if a bijection is computable, so is its inverse, so $\pi^{-1}$ is computable as well. In general, given a computable bijection $\s […]

The question is asking to find all polynomials $f$ for which you can find $a,b\in\mathbb R$ with $a\ne b$ such that the displayed identity holds. The concrete numbers $a,b$ may very well depend on $f$. A priori, it may be that for some $f$ there is only one pair for which the identity holds, it may be that for some $f$ there are many such pairs, and it may a […]

The reflection principle is a theorem schema in ZFC, meaning that for each formula $\phi(\vec x)$ we can prove in ZFC a version of the principle for $\phi$. In particular, it gives us that if $\phi$ holds (in the universe of sets) then there is some ordinal $\alpha$ such that $V_\alpha\models \phi$. It follows from this that (assuming its consistency) $\math […]

All proofs of the Bernstein-Cantor-Schroeder theorem that I know either directly or with very little work produce an explicit bijection from any given pair of injections. There is an obvious injection from $[0,1]$ to $C[0,1]$ mapping each $t$ to the function constantly equal to $t$, so the question reduces to finding an explicit injection from $C[0,1]$ to $[ […]