Fragments of First-Order Logic over Infinite Words (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Fragments of First-Order Logic over Infinite Words (Extended Abstract)

Abstract

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for ω-languages: Σ_2 , ∆_2 , FO^2∩ Σ_2 (and by duality FO^2∩ Π_2 ), and FO^2. These descriptions extend the respective results for finite words. In particular, we relate the above fragments to language classes of certain (unambiguous) polynomials. An immediate consequence is the decidability of the membership problem of these classes, but this was shown before by Wilke [20] and Bojanczyk [2] and is therefore not our main focus. The paper is about the interplay of algebraic, topological, and language theoretic properties.
Fichier principal
Vignette du fichier
27-diekert.pdf (248.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00359319 , version 1 (06-02-2009)

Identifiers

  • HAL Id : inria-00359319 , version 1

Cite

Volker Diekert, Manfred Kufleitner. Fragments of First-Order Logic over Infinite Words (Extended Abstract). 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.325-336. ⟨inria-00359319⟩

Collections

STACS2009
31 View
160 Download

Share

Gmail Facebook X LinkedIn More