This Fall I will be teaching Topics in set theory. The unofficial name of the course is Combinatorial Set Theory.

We will cover diverse topics in combinatorial set theory, depending on time and the interests of the audience, with emphasis on three topics: Choice-free combinatorics, cardinal arithmetic, and partition calculus (a generalization of Ramsey theory).

Time permitting, we can also cover large cardinals, determinacy and infinite games, or cardinal invariants (the study of sizes of sets of reals), among others. I’m open to suggestions for topics, so feel free to email me or to post a comment.

Pre-requisites: Permission by instructor. The recommended background is knowledge of cardinals and ordinals. A basic course on set theory (like 502: Logic and Set Theory) would be ideal but is not required.

Grading: Based on homework.

Textbook: Combinatorial set theory, by Neil H. Williams. Elsevier Science (1977). ISBN-10: 0720407222, ISBN-13: 978-0720407228. The book seems to be out of print.

We will also use:

Combinatorial Set Theory: Partition Relations for Cardinals, by Paul Erdös, András Hajnal, Attila Máté, and Richard Rado. Elsevier Science (1984). ISBN-10: 0444861572, ISBN-13: 978-0444861573. Apparently, this is also out of print.

I will distribute notes on the material of these books, on additional topics, and some papers that we will follow, particularly:

András Hajnal and Jean A. Larson. “Partition relations”, in Handbook of set theory, 129–213, Springer, 2010.

Jean A. Larson. “Infinite combinatorics”, in Handbook of the history of science, vol. 6, 145-357, Elsevier, 2012.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Monday, March 5th, 2012 at 12:34 pm and is filed under 580: Topics in set theory. 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.

I learned of this problem through Su Gao, who heard of it years ago while a post-doc at Caltech. David Gale introduced this game in the 70s, I believe. I am only aware of two references in print: Richard K. Guy. Unsolved problems in combinatorial games. In Games of No Chance, (R. J. Nowakowski ed.) MSRI Publications 29, Cambridge University Press, 1996, pp. […]

Let $C$ be the standard Cantor middle-third set. As a consequence of the Baire category theorem, there are numbers $r$ such that $C+r$ consists solely of irrational numbers, see here. What would be an explicit example of a number $r$ with this property? Short of an explicit example, are there any references addressing this question? A natural approach would […]

Suppose $M$ is an inner model (of $\mathsf{ZF}$) with the same reals as $V$, and let $A\subseteq \mathbb R$ be a set of reals in $M$. Suppose further that $A$ is determined in $M$. Under these assumptions, $A$ is also determined in $V$. The point is that since winning strategies are coded by reals, and any possible run of the game for $A$ is coded by a real, […]

Yes. This is obvious if there are no such cardinals. (I assume that the natural numbers of the universe of sets are the true natural numbers. Otherwise, the answer is no, and there is not much else to do.) Assume now that there are such cardinals, and that "large cardinal axiom" is something reasonable (so, provably in $\mathsf{ZFC}$, the relevant […]

Please send an email to mathrev@ams.org, explaining the issue. (This is our all-purpose email address; any mistakes you discover, not just regarding references, you can let us know there.) Give us some time, I promise we'll get to it. However, if it seems as if the request somehow fell through the cracks, you can always contact one of your friendly edit […]

First, prove that the map $\alpha\mapsto\omega^\alpha $ is normal, that is, strictly increasing and continuous at limits. Use this to show that for any $\alpha $ there is a least $\beta $ such that $\alpha

Consider any club subset of $\kappa $. Check that it has order type $\kappa>\lambda $, and that its $\lambda $th element (in its increasing enumeration) has cofinality $\lambda $.

A very nice introduction to this area is MR0891258(88g:03084). Simpson, Stephen G. Unprovable theorems and fast-growing functions. In Logic and combinatorics (Arcata, Calif., 1985), 359–394, Contemp. Math., 65, Amer. Math. Soc., Providence, RI, 1987. Simpson describes the paper as inspired by the question of whether there could be "a comprehensive, self […]

There are continuum many (i.e., $|\mathbb R|$) such functions. First of all, there are only $|\mathbb R|$ many continuous functions, so this is an upper bound. On the other hand, for any real $r$, $f(x)=x+r$ satisfies the requrements, so there are at least $|\mathbb R|$ many such functions.