The variable hierarchy for the games \(\mu \)-calculus

DOI10.1016/j.apal.2009.07.015zbMath1225.03028OpenAlexW2049417475MaRDI QIDQ636308

Luigi Santocanale, Walid Belkhir

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.07.015

zbMATH Keywords

complete latticesparity games\(\mu \)-calculi\(\mu \)-lattices

Mathematics Subject Classification ID

Applications of game theory (91A80) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (1)

Unification and combination of a class of traversal strategies made with pattern matching and fixed-points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The solutions of two star-height problems for regular trees
• Results on the propositional \(\mu\)-calculus
• A game semantics for linear logic
• Game logic -- an overview
• Game logic is strong enough for parity games
• Ambiguous classes in \(\mu\)-calculi hierarchies
• Matrix and matricial iteration theories. I
• A lattice-theoretical fixpoint theorem and its applications
• Automata for the modal μ-calculus and related results
• Games and full completeness for multiplicative linear logic
• μ-Bicomplete Categories and Parity Games
• Undirected Graphs of Entanglement 2
• Degrees of indeterminacy of games
• Logic for Programming, Artificial Intelligence, and Reasoning
• STACS 2005
• Rudiments of \(\mu\)-calculus
• Free \(\mu\)-lattices

This page was built for publication: The variable hierarchy for the games \(\mu \)-calculus