Sciweavers

Share
LATA
2010
Springer

Untestable Properties Expressible with Four First-Order Quantifiers

9 years 8 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a small, random sample of the structure. We focus on the classification of first-order sentences based on their quantifier prefixes and vocabulary into testable and untestable classes. This classification was initiated by Alon et al. [1], who showed that graph properties expressible with quantifier patterns are testable but that there is an untestable graph property expressible with quantifier pattern . In the present paper, their untestable example is simplified. In particular, it is shown that there is an untestable graph property expressible with each of the following quantifier patterns: , 2 , 2 and 3 . Key words: property testing, logic
Charles Jordan and Thomas Zeugmann
Added 02 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where LATA
Authors Charles Jordan and Thomas Zeugmann
Comments (0)
books