We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:


Current browse context:


Change to browse by:


References & Citations


(what is this?)
CiteULike logo BibSonomy logo Mendeley logo Facebook logo LinkedIn logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Logic in Computer Science

Title: Weak MSO: Automata and Expressiveness Modulo Bisimilarity

Abstract: We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to formulas $\varphi$ 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 $\mathrm{FOE}_1^\infty$ that is the extension of first-order logic with a generalized quantifier $\exists^\infty$, where $\exists^\infty x. \phi$ means that there are infinitely many objects satisfying $\phi$. An important part of our work consists of a model-theoretic analysis of $\mathrm{FOE}_1^\infty$.
Comments: Technical Report, 57 pages
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:1401.4374 [cs.LO]
  (or arXiv:1401.4374v2 [cs.LO] for this version)

Submission history

From: Facundo Carreiro [view email]
[v1] Fri, 17 Jan 2014 14:52:06 GMT (739kb)
[v2] Wed, 22 Jan 2014 17:46:41 GMT (748kb)