Monadic second order logic on tree-like structures
From MaRDI portal
(Redirected from Publication:4593948)
Recommendations
Cited in
(24)- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Counting on CTL^*: On the expressive power of monadic path logic
- Monadic second-order logic on tree-like structures
- Existential monadic second order logic on random rooted trees
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- Model theory of monadic predicate logic with the infinity quantifier
- Branch-width, parse trees, and monadic second-order logic for matroids.
- The alternation hierarchy in fixpoint logic with chop is strict too
- A selection property of the boolean \mu -calculus and some of its applications
- The Monadic Theory of Tree-like Structures
- scientific article; zbMATH DE number 2079025 (Why is no real title available?)
- Deciding the unguarded modal \(\mu\)-calculus
- An Extension of Muchnik's Theorem
- Complete axiomatizations of fragments of monadic second-order logic on finite trees
- Monadic Second-Order Logic and Transitive Closure Logics over Trees
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- Simple fixpoint iteration to solve parity games
- Monoidal-closed categories of tree automata
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus
- 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
- A quasi-polynomial black-box algorithm for fixed point evaluation
- The worst-case complexity of symmetric strategy improvement
- Backtracking games and inflationary fixed points
This page was built for publication: Monadic second order logic on tree-like structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593948)
