Definability with bounded number of bound variables
Information and Computation
Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Weakly Iterated Block Products of Finite Monoids
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An n! lower bound on formula size
ACM Transactions on Computational Logic (TOCL)
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
First-Order Logic with Two Variables and Unary Temporal
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
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 well-studied. 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[2[ For both languages, our structure theorems show exactly 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[