Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00359319
Contributor : Publications Loria <>
Submitted on : Friday, February 6, 2009 - 3:34:27 PM
Last modification on : Friday, February 13, 2009 - 10:28:57 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 10:00:56 PM

File

27-diekert.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00359319, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

73

Files downloads

239