First-order fragments with successor over infinite words

Jakub Kallas, Manfred Kufleitner & Alexander Lauser
We consider fragments of first-order logic and as models we allow finite andinfinite words simultaneously. The only binary relations apart from equalityare order comparison < and the successor predicate +1. We givecharacterizations of the fragments Sigma2 = Sigma2[
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.