A Note on the Testability of Ramsey's Class

Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a small, random sample of the object in question. Although much of the literature has focused on properties of graphs, very recently several strong results on hypergraphs have appeared. We revisit a logical result obtained by Alon et al. [1] in the light of these recent results. The main result is the testability of all properties (of relational structures) expressible in sentences of Ramsey’s class. Key words: property testing, logic, Ramsey’s class

• Type: Conference
• Year: 2010
• Where: TAMC
• Authors: Charles Jordan, Thomas Zeugmann
• Keywords: Desirable Property, Property Testing, Ramsey’s Class, TAMC 2010