Monadic second order logic on tree-like structures

DOI10.1007/3-540-60922-9_33zbMath1434.03105OpenAlexW1576702572MaRDI QIDQ4593948

Igor Walukiewicz

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_33

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Higher-order logic (03B16)

Related Items (13)

Model theory of monadic predicate logic with the infinity quantifier ⋮ The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs ⋮ Deciding the unguarded modal -calculus ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ Justifications and a reconstruction of parity game solving algorithms ⋮ Unnamed Item ⋮ A selection property of the boolean $\mu $-calculus and some of its applications ⋮ An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus ⋮ Theμ-calculus alternation-depth hierarchy is strict on binary trees ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Monadic second-order logic, graph coverings and unfoldings of transition systems ⋮ Backtracking games and inflationary fixed points

This page was built for publication: Monadic second order logic on tree-like structures