Bisimulation invariant monadic-second order logic in the finite

DOI10.1016/j.tcs.2020.03.001zbMath1484.03047arXiv1905.06668OpenAlexW2886189922MaRDI QIDQ2182315

Achim Blumensath, Felix Wolf

Publication date: 23 May 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06668

zbMATH Keywords

monadic second-order logicbisimulationcomposition method

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Higher-order logic (03B16)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic uses of the Feferman-Vaught theorem
• The monadic theory of order
• Modal languages and bounded fragments of predicate logic
• Modal logic over finite structures
• Counting on CTL\(^*\): On the expressive power of monadic path logic
• Automata, logics, and infinite games. A guide to current research
• Asymptotic Monadic Second-Order Logic
• Weak MSO
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Back and forth between guarded and modal logics
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

This page was built for publication: Bisimulation invariant monadic-second order logic in the finite