A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
[article]
2015
arXiv
pre-print
The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment Σ_2 over infinite words. Here, Σ_2 consists of the first-order formulas with two blocks of quantifiers,
arXiv:1509.06207v1
fatcat:agg5o2xkizg7hcs46ie2izpw5a