Indistinguishability and First-Order Logic

The "richness" of properties that are indistinguishable from first-order properties is investigated. Indistinguishability is a concept of equivalence among properties of combinatorial structures that is appropriate in the context of testability. All formulas in a restricted class of second-order logic are shown to be indistinguishable from first-order formulas. Arbitrarily hard properties, including RE-complete properties, that are indistinguishable from first-order formulas are shown to exist. Implications on the search for a logical characterization of the testable properties are discussed.

[1]  J. Hromkovic,et al.  Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) , 2005 .

[2]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[3]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[4]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[5]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[7]  Sanguthevar Rajasekaran.  Handbook of randomized computing , 2001 .

[8]  Juraj Hromkovic.  Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Vojtech Rödl,et al.  Property testing in hypergraphs and the removal lemma , 2007, STOC '07.

[10]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[12]  Diederich Hinrichsen,et al.  Mathematical Systems Theory I , 2006, IEEE Transactions on Automatic Control.

[13]  Rajeev Alur,et al.  Time-Adaptive Algorithms for Synchronization , 1997, SIAM J. Comput..

[14]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[15]  Ronald Fagin,et al.  On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[16]  Rusins Freivalds,et al.  Fast Probabilistic Algorithms , 1979, MFCS.

[17]  Dana Ron,et al.  Property Testing , 2000 .

[18]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[19]  Eldar Fischer,et al.  A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation. , 2001 .

[20]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[21]  Eldar Fischer,et al.  Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems , 2005 .

[22]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[23]  N. Alon,et al.  testing of large graphs , 2000 .

[24]  Neil Immerman,et al.  A First-Order Isomorphism Theorem , 1997, SIAM J. Comput..

[25]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[26]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, Comb..

[27]  Jiří Bečvář,et al.  Mathematical Foundations of Computer Science 1979 , 1979, Lecture Notes in Computer Science.

[28]  Eldar Fischer,et al.  The Art of Uninformed Decisions , 2001, Bull. EATCS.