University of Cambridge > > Isaac Newton Institute Seminar Series > On Ramsey-like theorems on the rationals and the Rado graph

On Ramsey-like theorems on the rationals and the Rado graph

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

SASW09 - International conference on computability, complexity and randomness

Ramsey theorem implies for every 2-coloring of pairs of naturals there is an infinite set H of naturals where all the pairs formed from H have the same color.  We will explore how to extend this to the rationals, the Rado graph and some other relational homogenous countable structures. One of the main tools used in these extensions is Milliken’s tree theorem and it’s recent modifications.  Our goal is to try to understand the arithmetic complexity of the resulting “homogenous” set or structure. I.e. if the colorings are computable is there a “homogenous” structure within the arithmetical hierarchy and if so where.   

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity