A Note on the Testability of Ramsey’s Class
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.  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.
Keywordsproperty testing logic Ramsey’s class
Unable to display preview. Download preview PDF.
- 4.Austin, T., Tao, T.: On the testability and repair of hereditary hypergraph properties. arXiv.org as arXiv:0801.2179v2 (2009) (preprint)Google Scholar
- 6.Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press, London (2000)Google Scholar
- 7.Fischer, E.: Testing graphs for colorability properties. In: Proceedings, 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 873–882 (2001)Google Scholar
- 10.Kolaitis, P., Vardi, M.: The decision problem for the probabilities of higher-order properties. In: STOC 1987: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 425–435. ACM, New York (1987)Google Scholar