Two-variable logic on data words
✍ Scribed by Bojańczyk, Mikołaj; David, Claire; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc
- Book ID
- 121298343
- Publisher
- Association for Computing Machinery
- Year
- 2011
- Tongue
- English
- Weight
- 268 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1529-3785
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We show that the existential preservation theorem fails for two‐variable first‐order logic FO^2^. It is known that for all __k__ ≥ 3, FO^k^ does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In
The main result of this paper is the extension of the theorem of Schützenberger, McNaughton, and Papert on star-free sets of finite words to languages of words of countable length. We also give another proof of the theorem of Büchi which establishes the equivalence between automata and monadic secon