(Un)countable and (Non)effective Versions of Ramsey's Theorem

We review Ramsey’s theorem and its extensions by Jockusch for computable partitions, by Sierpiński and by Erdős and Rado for uncountable homogeneous sets, by Rubin for automatic partitions, and by the author for ω-automatic (in particular uncountable) partitions.

[1]  Carl G. Jockusch,et al.  Ramsey's theorem and recursion theory , 1972, Journal of Symbolic Logic.

[2]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[3]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[4]  R. Root.  A Problem on Ordered Sets , 2002 .

[5]  Achim Blumensath,et al.  Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.

[6]  C. Delhommé.  Automaticité des ordinaux et des graphes homogènes , 2004 .

[7]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[8]  Dietrich Kuske,et al.  IS RAMSEY'S THEOREM ω- AUTOMATIC? , 2010 .

[9]  W. Sierpinski,et al.  Sur un problème de la théorie des relations , 1937 .

[10]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[11]  Sasha Rubin,et al.  On automatic partial orders , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[12]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.