On FO2 quantifier alternation over words - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

On FO2 quantifier alternation over words

Résumé

We show that each level of the quantifier alternation hierarchy within FO^2[<] -- the 2-variable fragment of the first order logic of order on words -- is a variety of languages. We then use the notion of condensed rankers, a refinement of the rankers defined by Weis and Immerman, to produce a decidable hierarchy of varieties which is interwoven with the quantifier alternation hierarchy -- and conjecturally equal to it. It follows that the latter hierarchy is decidable within one unit: given a formula alpha in FO^2[<], one can effectively compute an integer m such that alpha is equivalent to a formula with at most m+1 alternating blocks of quantifiers, but not to a formula with only m-1 blocks. This is a much more precise result than what is known about the quantifier alternation hierarchy within FO[<], where no decidability result is known beyond the very first levels.
Fichier principal
Vignette du fichier
KufleitnerWeil200904.pdf (182.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00376640 , version 1 (19-04-2009)

Identifiants

Citer

Manfred Kufleitner, Pascal Weil. On FO2 quantifier alternation over words. Mathematical Foundations of Computer Science 2009, Aug 2009, Slovakia. pp.513-524. ⟨hal-00376640⟩

Collections

CNRS ANR
113 Consultations
100 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More