Notes on Ramsey Theory ...
    <a href="ramsey.tex">ramsey.tex</a> ..
    <a href="ramsey.pdf">ramsey.pdf</a>


<p>

<br> Fall 1996
<br>
<br> course no.:    873
<br> title:         Topics in Foundations
<br> instructor:    A. Miller
<br> prerequisite:  771
<br> book:          none
<br> description:
<br>
<br> This course will be about infinite combinatorics.  We will start
<br> with the Galvin-Prikry Theorem which is an infinite analogue
<br> of Ramsey's Theorem for Borel partitions.   We plan to cover Hindman's
<br> theorem and its Borel generalization due to Milliken.  Also the
<br> dual-Ramsey theorem of Carlson-Simpson and the infinitary version of the
<br> Hales-Jewitt Theorem due to Carlson.   We will cover
<br> betterquasi-order theory and its use by Laver to prove Fraisse's
<br> conjecture: Given any sequence L(n) of countable linear orders
<br> there exists n less than m such that L(n) order embeds into L(m).
<br>
<br>those attending:
<br> 
<br>joni erin baker
<br>evan john griffiths
<br>moses gabriel klein
<br>stephen will tanner
<br>yeh
<br>mark fuller