The Crane Beach Conjecture

A language L over an alphabet A is said to have a neutral letter if there is a letter e/spl isin/A such that inserting or deleting e's from any word in A* does not change its membership (or non-membership) in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order then it is not definable in first-order. Logic with any set /spl Nscr/ of numerical predicates. We investigate this conjecture in detail, showing that it fails already for /spl Nscr/={+, *}, or possibly stronger for any set /spl Nscr/ that allows counting up to the m times iterated logarithm, 1g/sup (m)/, for any constant m. On the positive side, we prove the conjecture for the case of all monadic numerical predicates, for /spl Nscr/={+}, for the fragment BC(/spl Sigma/) of first-order logic, and for binary alphabets.

[1]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[2]  James F. Lynch,et al.  On sets of relations definable by addition , 1982, Journal of Symbolic Logic.

[3]  Michael A. Taitslin,et al.  Extended Order-Generic Queries , 1999, Ann. Pure Appl. Log..

[4]  BarringtonDavid A. Mix,et al.  Regular languages in NC1 , 1992 .

[5]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[6]  I. Wegener,et al.  Boolean Function Complexity: Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size , 1992 .

[7]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[8]  Howard Straubing,et al.  Regular Languages in NC¹ , 1992, J. Comput. Syst. Sci..

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

[10]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[11]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[12]  Thomas Schwentick.  Padding and the Expressive Power of Existential Second-Order Logics , 1997, CSL.

[13]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[14]  Ronald Fagin,et al.  Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions , 1985, Theoretical Computer Science.

[15]  Saharon Shelah,et al.  Definability by Constant-Depth Polynomial-Size Circuits , 1986, Inf. Control..

[16]  Howard Straubing.  Languages Defined with Modular Counting Quantifiers , 2001, Inf. Comput..

[17]  Ingo Wegener,et al.  Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size , 1990, MFCS.

[18]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

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

[20]  Nicole Schweikardt,et al.  An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases , 2001, STACS.

[21]  Julia Robinson,et al.  Definability and decision problems in arithmetic , 1949, Journal of Symbolic Logic.

[22]  Michael Benedikt,et al.  Expressive Power: The Finite Case , 2000, Constraint Databases.

[23]  Thomas Schwentick,et al.  The Descriptive Complexity Approach to LOGCFL , 2001, J. Comput. Syst. Sci..

[24]  Thomas Schwentick,et al.  The Descriptive Complexity Approach to LOGCFL , 1998, J. Comput. Syst. Sci..