Pages that link to "Item:Q4593954"
From MaRDI portal
The following pages link to On the expressivity of the modal mu-calculus (Q4593954):
Displaying 21 items.
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
- On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions (Q1854404) (← links)
- Mu-depth 3 is more than 2: A game-theoretic proof (Q2719798) (← links)
- Automated synthesis of enforcing mechanisms for security properties in a timed setting (Q2866731) (← links)
- On closure ordinals for the modal mu−calculus (Q2958510) (← links)
- (Q3002404) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- (Q4381381) (← links)
- (Q4525272) (← links)
- Justifying induction on modal -formulae (Q4644493) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
- On modal -calculus over reflexive symmetric graphs (Q5300576) (← links)
- STACS 2004 (Q5309728) (← links)
- (Q5687237) (← links)
- STACS 2005 (Q5710722) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q6104376) (← links)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic (Q6104378) (← links)
- Succinctness in subsystems of the spatial mu-calculus (Q6290036) (← links)