On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2004

On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus

Résumé

In1970, Rabin shows that a language is recognizable by a tree automaton with Bu ̈chi like infinitary condition if and only if it is definable as the projection of a weakly definable language. In this paper, we refine this result characterizing such languages as those definable in the monadic Σ2 level of the quantifier alternation depth hierarchy of monadic second order logic (MSO). This new result also contributes to a better understanding of the relationship between the quantifier alternation depth of hierarchy of MSO and the fixpoint alternation depth hierarchy of the mu- calculus: it shows that the bisimulation invariant fragment of the monadic Σ2 level equals the νμ- level of the mu-calculus hierarchy.
Fichier principal
Vignette du fichier
final.pdf (156.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00659987 , version 1 (14-01-2012)

Identifiants

  • HAL Id : hal-00659987 , version 1

Citer

David Janin, Giacomo Lenzi. On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus. Fundamenta Informaticae, 2004, 61 (3-4), pp.247--265. ⟨hal-00659987⟩

Collections

CNRS
83 Consultations
143 Téléchargements

Partager

Gmail Facebook X LinkedIn More