Name
Abstract | ||
|---|---|---|
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal μ-calculus where the application of the least fixpoint operator μp.φ is restricted to formulas φ that are continuous in p. Our proof is automata-theoretic in nature; in particular, we introduce a class of automata characterizing the expressive power of WMSO over tree models of arbitrary branching degree. The transition map of these automata is defined in terms of a logic FOE1∞ that is the extension of first-order logic with a generalized quantifier ∃∞, where ∃∞x.φ means that there are infinitely many objects satisfying φ. An important part of our work consists of a model-theoretic analysis of FOE1∞. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2603088.2603101 | CSL-LICS |
Keywords | DocType | Volume |
automata theory,automata,mathematical logic,modal mu-calculus,mso-automata,bisimulation invariance,weak monadic second-order,characterisation theorem,theory,janin-walukiewicz theorem,wmso | Journal | abs/1401.4374 |
Citations | PageRank | References |
4 | 0.43 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Facundo Carreiro | 1 | 12 | 4.09 |
| Alessandro Facchini | 2 | 35 | 9.47 |
| Yde Venema | 3 | 609 | 65.12 |
| Fabio Zanasi | 4 | 110 | 13.89 |