Is Ramsey's theorem omega-automatic?

We study the existence of infinite cliques in omega-automatic (hyper-)graphs. It turns out that the situation is much nicer than in general uncountable graphs, but not as nice as for automatic graphs. More specifically, we show that every uncountable omega-automatic graph contains an uncountable co-context-free clique or anticlique, but not necessarily a context-free (let alone regular) clique or anticlique. We also show that uncountable omega-automatic ternary hypergraphs need not have uncountable cliques or anticliques at all.

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

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

[3]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

[5]  Waclaw Sierpiński.  Ricerche sulle superficie elicoidali e sulle superficie a curvatura costante , 1879 .

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

[7]  D. Kuske,et al.  First-order and counting theories of ω-automatic structures , 2008, Journal of Symbolic Logic.

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

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

[10]  W. Gasarch.  A Survey of Recursive Combinatorics , 2007 .

[11]  Greg Hjorth,et al.  From Automatic Structures to Borel Structures , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

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

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

[14]  F. Stephan,et al.  Set theory , 2018, Mathematical Statistics with Applications in R.