I have been asked to be part of the Scientific committee for the sixth Young set theory workshop, to be held in Piamonte, Italy, during a week in Spring 2013. The other members of the committee are Matteo Viale (chair), Asgard Tornquist, Sean Cox, and Andrew Brooke-Taylor.

James Cummings – Large cardinals: PCF-theory and its interactions with large cardinals, forcing and -like combinatorial principles. The tutorial will focus on applications of Shelah’s PCF-theory outside cardinal arithmetic, including constructions for Jónsson algebras, strong covering lemmas, and constructions for almost-free, non-free objects.

Sy David Friedman – Forcing and combinatorial set theory: Descriptive set theory on . Assuming GCH, most of the basic notions of classical descriptive set theory generalize easily from Baire space to generalized Baire space , for an uncountable regular cardinal . But many of the theorems do not. The tutorial will discuss regularity properties and the Borel reducibility of deﬁnable equivalence relations in the generalized setting.

Su Gao – Descriptive Set Theory: Borel markers in the study of countable Borel equivalence relations. The tutorial will give an introduction to the theory of Borel markers in the study of countable Borel equivalence relations. Borel markers are important tools used to attach structures to the classes of countable Borel equivalence relations. They play a prominent role in the study of hyperﬁnite and treeable equivalence relations, and have applications in other topics such as the computation of Borel chromatic numbers.

John Steel – Inner Model Theory: Iteration Trees. The tutorial will cover the basic theory of iteration trees, and some of its applications. It starts at a basic level, deﬁning ultrapowers of models of ZFC and their properties, and tries to keep the presentation accessible to anyone who has taken a graduate-level course in set theory. (In particular, no background in inner model theory will be assumed.)

I will add more details as they are decided, we expect to invite five post doctoral researchers to give one hour talks. For now, here are the links to the previous workshops:

This entry was posted on Wednesday, August 22nd, 2012 at 3:48 pm and is filed under Conferences. 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.

3 Responses to Upcoming: 6th Young set theory workshop

As suggested by Gerald, the notion was first introduced for groups. Given a directed system of groups, their direct limit was defined as a quotient of their direct product (which was referred to as their "weak product"). The general notion is a clear generalization, although the original reference only deals with groups. As mentioned by Cameron Zwa […]

A database of number fields, by Jürgen Klüners and Gunter Malle. (Note this is not the same as the one mentioned in this answer.) The site also provides links to similar databases.

As the other answer indicates, the yes answer to your question is known as the De Bruijn-Erdős theorem. This holds regardless of the size of the graph. The De Bruijn–Erdős theorem is a particular instance of what in combinatorics we call a compactness argument or Rado's selection principle, and its truth can be seen as a consequence of the topological c […]

Every $P_c$ has the size of the reals. For instance, suppose $\sum_n a_n=c$ and start by writing $\mathbb N=A\cup B$ where $\sum_{n\in A}a_n$ converges absolutely (to $a$, say). This is possible because $a_n\to 0$: Let $m_0

Consider a subset $\Omega$ of $\mathbb R$ of size $\aleph_1$ and ordered in type $\omega_1$. (This uses the axiom of choice.) Let $\mathcal F$ be the $\sigma$-algebra generated by the initial segments of $\Omega$ under the well-ordering (so all sets in $\mathcal F$ are countable or co-countable), with the measure that assigns $0$ to the countable sets and $1 […]

Sure. A large class of examples comes from the partition calculus. A simple result of the kind I have in mind is the following: Any infinite graph contains either a copy of the complete graph on countably many vertices or of the independent graph on countably many vertices. However, if we want to find an uncountable complete or independent graph, it is not e […]

I think that, from a modern point of view, there is a misunderstanding in the position that you suggest in your question. Really, "set theory" should be understood as an umbrella term that covers a whole hierarchy of ZFC-related theories. Perhaps one of the most significant advances in foundations is the identification of the consistency strength h […]

I'll only discuss the first question. As pointed out by Asaf, the argument is not correct, but something interesting can be said anyway. There are a couple of issues. A key problem is with the idea of an "explicitly constructed" set. Indeed, for instance, there are explicitly constructed sets of reals that are uncountable and of size continuum […]

The question seems to be: Assume that there is a Vitali set $V$. Is there an explicit bijection between $V$ and $\mathbb R$? The answer is yes, by an application of the Cantor-Schröder-Bernstein theorem: there is an explicit injection from $\mathbb R$ into $\mathbb R/\mathbb Q$ (provably in ZF, this requires some thought, or see the answers to this question) […]

If a set $X$ is well-founded (essentially, if it contains no infinite $\in$-descending chains), then indeed $\emptyset$ belongs to its transitive closure, that is, either $X=\emptyset$ or $\emptyset\in\bigcup X$ or $\emptyset\in\bigcup\bigcup X$ or... However, this does not mean that there is some $n$ such that the result of iterating the union operation $n$ […]

Since this page is the first google hit for “Young Set Theory 2013”, I thought I’d link here to the webpage for the conference that is now up:

http://www2.dm.unito.it/paginepersonali/viale/YST2013/yst2013-home.html

Also note that registration is open until the end of February.

Thanks Andrew, that reminds me I need to post an update. Why don’t you post a link on G+ meanwhile?

Sorry – that’s a good idea but I only just saw it, and I see that you beat me to it!