Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decidable Characterization of FO2(<,+1) and locality of DA

Published 10 Jun 2016 in cs.FL | (1606.03217v2)

Abstract: Several years ago Th\'erien and Wilke exhibited a decidable characterization of the languages of words that are definable in FO2(<,+1). Their proof relies on three separate ingredients. The first one is the characterization of the languages that are definable in FO2(<) as those whose syntactic semigroup belongs to the variety DA. Then, this result is combined with a wreath product argument showing that being definable in FO2(<,+1) corresponds to having a syntactic semigroup in DA*D. Finally, proving that membership of a semigroup in DA*D is decidable requires a third ingredient: the "locality" of DA, a result proved by Almeida. In this note we present a new self-contained and simple proof that definability in FO2(<,+1) is decidable. We obtain the locality of DA as a corollary.

Authors (2)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.