Weak MSO+U over infinite trees
From MaRDI portal
Publication:2904801
DOI10.4230/LIPICS.STACS.2012.648zbMATH Open1245.68119MaRDI QIDQ2904801FDOQ2904801
Authors: Mikołaj Bojańczyk, Szymon Toruńczyk 
Publication date: 23 August 2012
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Cited In (24)
- A unified approach to boundedness properties in MSO
- Recursion schemes and the WMSO+U logic
- Contribution of Warsaw logicians to computational logic
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Delay games with WMSO+U winning conditions
- Weak MSO: automata and expressiveness modulo bisimilarity
- New algorithm for weak monadic second-order logic on inductive structures
- Thin MSO with a probabilistic path quantifier
- Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
- On a fragment of AMSO and tiling systems
- Weak MSO with the unbounding quantifier
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Forcing MSO on infinite words in weak MSO
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Delay games with WMSO+U winning conditions
- Weak MSO+U with path quantifiers over infinite trees
- Computer Science Logic
- On the decidability of MSO+U on infinite trees
- Trees over infinite structures and path logics with synchronization
- Monadic second order finite satisfiability and unbounded tree-width
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Asymptotic Monadic Second-Order Logic
- Undecidable first-order theories of affine geometries
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)
