Structure Theorem and Strict Alternation Hierarchy for FO2 on Words

  • P. Weis
  • N. Immerman
Conference paper

DOI: 10.1007/978-3-540-74915-8_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4646)
Cite this paper as:
Weis P., Immerman N. (2007) Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. In: Duparc J., Henzinger T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg

Abstract

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and wellstudied. We prove precise structure theorems that characterize the exact expressive power of first-order logic with two variables on words. Our results apply to FO2[<] and FO2[<; Suc], the latter of which includes the binary successor relation in addition to the linear ordering on string positions.

For both languages, our structuretheorems showexactly whatis expressible using a given quantifier depth, n, and using m blocks of alternating quantifiers, for any m ≤ n. Using these characterizations, we prove, among other results, that there is a strict hierarchy of alternating quantifiers for both languages. The question whether there was such a hierarchy had been completely open. As another consequence of our structural results, we show that satisfiability for FO2[<], which is NEXP-complete in general, becomes NP-complete once we only consider alphabets of a bounded size.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • P. Weis
    • 1
  • N. Immerman
    • 1
  1. 1.Department of Computer Science University of Massachusetts, Amherst 140 Governors Drive, Amherst, MA 01003USA

Personalised recommendations