Fragments of first-order logic over infinite words

Details Fragments of first-order logic over infinite words Fragments of first-order logic over infinite words

2009-06-16

arxiv.org/abs/0906.2995v2

Computer Science

Formal Languages and Automata Theory

Conference version presented at 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009

Scientific paper

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and by duality Pi_2 and the intersection of FO^2 and Pi_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 and Bojanczyk and is therefore not our main focus. The paper is about the interplay of algebraic, topological, and language theoretic properties.

Affiliated with

Also associated with

No associations

Rating

Fragments of first-order logic over infinite words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fragments of first-order logic over infinite words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fragments of first-order logic over infinite words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476079