Arrow Research search
Back to Highlights

Highlights 2013

Expressiveness modulo bisimilarity: a coalgebraic perspective

Conference Abstract Highlights presentation Logic in Computer Science ยท Theoretical Computer Science

Abstract

Janin and Walukiewicz showed that the modal mu-calculus MC is the bisimulation-invariant fragment of monadic second-order logic MSO. Their proof uses parity automata with a transition map defined in terms of monadic first-order logic. We decompose their proof in three parts: (1) automata-theoretic characterizations of MSO and MC respectively, (2) a simple model-theoretic characterization of the identity-free fragment of monadic first-order logic, and (3) a coalgebraic result, stating that the second result propagates from the `one-step level' to the level of full fixpoint logics.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
338886673043547294
v2026.09.13