Finite-Degree Predicates and Two-Variable First-Order Logic

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature.

[1]  Manfred Kufleitner,et al.  The FO^2 alternation hierarchy is decidable , 2012, CSL.

[2]  Kohei Kishida,et al.  Computer Science Logic 2015 , 2015 .

[3]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[4]  Howard Straubing,et al.  An effective characterization of the alternation hierarchy in two-variable logic , 2012, FSTTCS.

[5]  Andreas Krebs,et al.  Non-definability of Languages by Generalized First-order Formulas over (N,+) , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[6]  Howard Straubing,et al.  Definability of Languages by Generalized First-Order Formulas over N+ , 2007, SIAM J. Comput..

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

[8]  Jaikumar Radhakrishnan,et al.  Deterministic restrictions in circuit complexity , 1996, STOC '96.

[9]  Michal Koucký,et al.  Circuit Complexity of Regular Languages , 2007, Theory of Computing Systems.

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

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

[12]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[13]  Pavel Pudlák,et al.  Bounded-depth circuits: separating wires from gates , 2005, STOC '05.

[14]  Avi Wigderson,et al.  Linear-Size Constant-Depth Polylog-Treshold Circuits , 1991, Inf. Process. Lett..

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

[16]  Manfred Kufleitner,et al.  Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable , 2012, STACS.

[17]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[18]  Denis Thérien,et al.  Circuit lower bounds via Ehrenfeucht-Fraisse games , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[19]  Neil Immerman,et al.  Structure Theorem and Strict Alternation Hierarchy for FO2 on Words , 2006, Circuits, Logic, and Games.

[20]  Richard J. Lipton,et al.  Lower Bounds for Constant Depth Circuits for Prefix Problems , 1983, ICALP.

[21]  Neil Immerman,et al.  First-order expressibility of languages with neutral letters or: The Crane Beach conjecture , 2005, J. Comput. Syst. Sci..