Is Ramsey's theorem omega-automatic?

DOI10.4230/LIPIcs.STACS.2010.2483zbMath1230.03067OpenAlexW2964300199MaRDI QIDQ3113778

Dietrich Kuske

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_b497.html

zbMATH Keywords

automataRamsey theorylogic in computer science

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ A hierarchy of tree-automatic structures ⋮ Model-theoretic properties of \(\omega\)-automatic structures

This page was built for publication: Is Ramsey's theorem omega-automatic?