I just finished a talk at the Department Colloquium on Sets and Games. I have posted the slides in my talks page. About a year ago I gave a talk in the Graduate Student Seminar on Determinacy (also available in my talks page). Though that talk was significantly less technical, it covers a nice bit of history that I had to skip in this case, and I think the two complement each other well.

The talk today covered some of my recent results with Richard Ketchersid on the structure of natural models of determinacy. (I have discussed technical details of the proofs in other talks, also available at the page linked to above.) At the end I touched on some recent results with Boban Velickovic on failures of square principles (inspired by similar recent results of Dilip Raghavan), and on the results of the SQuaRE group I am a part of:

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Thursday, September 1st, 2011 at 1:13 pm and is filed under Talks. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

It should be in your mailbox now. But I think you can download it as well. That was the idea, anyway. The resolution is not great, though, sorry about that.

The key reference for this is MR0799042 (87d:03141). Henle, J. M.; Mathias, A. R. D.; Woodin, W. Hugh. A barren extension. In Methods in mathematical logic (Caracas, 1983), C. A. Di Prisco, editor, 195–207, Lecture Notes in Math., 1130, Springer, Berlin, 1985. There, Henle, Mathias, and Woodin start with $L(\mathbb R)$ under the assumption of determinacy (an […]

This is consistent, at least under a rather tame large cardinal assumption. (One can also produce examples by manipulating Dedekind finite sets, but Asaf's answer addresses this. The answer here works even in the context of $\mathsf{DC}$.) For instance, see MR3612001. Conley, Clinton T.; Miller, Benjamin D. Measure reducibility of countable Borel equiva […]

The only reference I know for precisely these matters is the handbook chapter MR2768702. Koellner, Peter; Woodin, W. Hugh. Large cardinals from determinacy. In Handbook of set theory. Vols. 1, 2, 3, 1951–2119, Springer, Dordrecht, 2010. (Particularly, section 7.) For closely related topics, see also the work of Yong Cheng (and of Cheng and Schindler) on Harr […]

As other answers point out, yes, one needs choice. The popular/natural examples of models of ZF+DC where all sets of reals are measurable are models of determinacy, and Solovay's model. They are related in deep ways, actually, through large cardinals. (Under enough large cardinals, $L({\mathbb R})$ of $V$ is a model of determinacy and (something stronge […]

No, you cannot show this. For instance, it is consistent to have infinite Dedekind-finite sets whose power set is still Dedekind-finite. Now, if there is a surjection from $A$ to $\omega$, then there is an injection from $\omega$ (indeed, from $\mathcal P(\omega)$) to $\mathcal P(A)$, so $\mathcal P(A)$ is Dedekind-infinite. Thus, if $\mathcal P(X)$ is infin […]

First, there are some nice examples like $$ e=\sum_{n\ge0}\frac1{n!} $$ or Liouville-like numbers, mentioned in the answers by Wilem2, that can be easily proved to be irrational using the theorem, but for which typically there are simpler irrationality proofs: For $e$, we quickly get that $$0

Note first that if $C$ is uncountable and for each $i\in C$ we have a real number $r_i>0$, then $\sum_i r_i=+\infty$. The point is that for some $n>0$, the family $\{i\in C: r_i>1/n\}$ is uncountable. Of course, in this case there is a countable subfamily whose sum is infinite as well. Now, let $A$ be measurable of infinite measure. If there is an u […]

The theorem says that to prove an implication it is enough to assume the hypothesis and proceed to prove the conclusion. Proofs of that kind tend to be more natural than proofs that conclude the implication directly. Just as in regular mathematical practice: many theorems have the form "Assuming $A$, then we have $B$", and we usually prove them by […]

A cardinal $\kappa$ is huge if and only if it is uncountable and there is a $\kappa$-complete normal ultrafilter $\mathcal U$ over some $\mathcal P(\lambda)$ such that $\{x\in\mathcal P(\lambda)\mid \mathrm{ot}(x\cap \lambda)=\kappa\}\in\mathcal U$. The immediate advantage of this formulation over the one in terms of elementary embeddings is that it shows th […]

Where can we get this picture. It is very nice.

Hi Grigor,

It should be in your mailbox now. But I think you can download it as well. That was the idea, anyway. The resolution is not great, though, sorry about that.

[…] Inner model theory”. The first meeting took place on May 16-20, 2011, you can see a picture here. This year we met for a follow-up, on April […]

[…] mentioned previously, I am part of a SQuaRE (Structured Quartet Research Ensemble), “Descriptive […]

[…] meeting on Descriptive aspects of Inner model theory. The previous two meetings are mentioned here and here. See also this post on some of our […]