On logical hierarchies within FO2-definable languages - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2012

On logical hierarchies within FO2-definable languages

Résumé

We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier alternations yields an infinite hierarchy whose levels are varieties of languages (and hence admit an algebraic characterization). Using this algebraic approach, we show that the quantifier alternation hierarchy inside FO2[<] is decidable within one unit. For this purpose, we relate each level of the hierarchy with decidable varieties of languages, which can be defined in terms of iterated deterministic and co-deterministic products. A crucial notion in this process is that of condensed rankers, a refinement of the rankers of Weis and Immerman and the turtle languages of Schwentick, Therien and Vollmer.
Fichier principal
Vignette du fichier
fo2alt.pdf (1 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00567171 , version 1 (18-02-2011)
hal-00567171 , version 2 (16-03-2012)

Identifiants

Citer

Manfred Kufleitner, Pascal Weil. On logical hierarchies within FO2-definable languages. Logical Methods in Computer Science, 2012, 8 (3:11), pp.1-30. ⟨10.2168/LMCS-8(3:11)2012⟩. ⟨hal-00567171v2⟩

Collections

CNRS ANR
266 Consultations
210 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More