Pages that link to "Item:Q3454725"
From MaRDI portal
The following pages link to On the Modal μ-Calculus Over Finite Symmetric Graphs (Q3454725):
Displaying 8 items.
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- Mu-depth 3 is more than 2: A game-theoretic proof (Q2719798) (← links)
- On modal \(\mu \)-calculus in \(S5\) and applications (Q2841958) (← links)
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width (Q2909221) (← links)
- (Q4440829) (← links)
- On modal -calculus over reflexive symmetric graphs (Q5300576) (← links)
- STACS 2004 (Q5309728) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)