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 and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of the fragments Sigma_2 = Sigma_2[