Weak MSO+U over infinite trees
From MaRDI portal
Publication:2904801
Recommendations
Cited in
(29)- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Contribution of Warsaw logicians to computational logic
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Undecidable first-order theories of affine geometries
- Asymptotic Monadic Second-Order Logic
- Delay games with WMSO+U winning conditions
- Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
- Delay games with WMSO+U winning conditions
- Recursion schemes and the WMSO+U logic
- New algorithm for weak monadic second-order logic on inductive structures
- Thin MSO with a probabilistic path quantifier
- On a fragment of AMSO and tiling systems
- Weak MSO: automata and expressiveness modulo bisimilarity
- Trees over infinite structures and path logics with synchronization
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Recursion schemes, the MSO logic, and the \textsf{U} quantifier
- Weak MSO+U with path quantifiers over infinite trees
- On the decidability of MSO+U on infinite trees
- Undecidability of a weak version of MSO+U
- Forcing MSO on infinite words in weak MSO
- Monadic second order finite satisfiability and unbounded tree-width
- Computer Science Logic
- A unified approach to boundedness properties in MSO
- Weak MSO with the unbounding quantifier
- Extending the WMSO+U logic with quantification over tuples
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
This page was built for publication: Weak \(\text{MSO}+U\) over infinite trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904801)
