The following pages link to Games for the \(\mu\)-calculus (Q671352):
Displaying 24 items.
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- Cyclic proofs, hypersequents, and transitive closure logic (Q2104539) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374) (← links)
- Two Ways to Common Knowledge (Q3185764) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
- (Q5208872) (← links)
- $$\mu $$ μ -Levels of Interpolation (Q5214736) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- Cyclic hypersequent system for transitive closure logic (Q6050767) (← links)
