Level Two of the Quantifier Alternation Hierarchy over Infinite Words

Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13) Automata and formal grammars in connection with logical questions (03D05)

Abstract: 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

S i g m a_{2}

over infinite words. Here,

S i g m a_{2}

consists of the first-order formulas with two blocks of quantifiers, starting with an existential quantifier. Its Boolean closure is

m a t h b b B S i g m a_{2}

. Our first main result is an effective characterization of the Boolean closure of the alphabetic topology, that is, given an

o m e g a

-regular language

L

, it is decidable whether

L

is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun's recent decidability result for

m a t h b b B S i g m a_{2}

from finite to infinite words.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Level Two of the Quantifier Alternation Hierarchy over Infinite Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740188)