Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
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.
Unable to display preview. Download preview PDF.
- 3.Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. In: IEEE Symposium on Logic in Computer Science (1997)Google Scholar
- 8.Kamp, J.A.: Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles (1968)Google Scholar
- 13.Schwentick, T., Thérien, D., Vollmer, H.: Partially-ordered two-way automata: a new characterization of DA. In Developments in Language Theory (2001) Google Scholar
- 14.Straubing, H., Thérien, D.: Weakly iterated block products. In: 5th Latin American Theoretical Informatics Conference (2002) Google Scholar
- 15.Tesson, P., Thérien, D.: Diamonds are forever: the variety DA. In Semigroups, Algorithms, Automata and Languages (2001) Google Scholar
- 17.Thérien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: ACM Symposium on Theory of Computing (1998) Google Scholar
- 20.Weis, P., and Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words (2007), http://www.cs.umass.edu/~immerman/pub/FO2_on_words.pdf
- 21.Wilke, T.: Personal communication (2007)Google Scholar