The Variable Hierarchy for the Games mu-Calculus
| dc.creator | Belkhir, Walid | |
| dc.creator | Santocanale, Luigi | |
| dc.date | 2007-10-12 | |
| dc.date | 2008-03-13 | |
| dc.date.accessioned | 2026-07-07T09:26:18Z | |
| dc.date.available | 2026-07-07T09:26:18Z | |
| dc.description | Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional modal mu-calculus, it is possible to classify parity games into levels of a hierarchy according to the number of fixed-point variables. We ask whether this hierarchy collapses w.r.t. the standard interpretation of the games mu-calculus into the class of all complete lattices. We answer this question negatively by providing, for each n >= 1, a parity game Gn with these properties: it unravels to a mu-term built up with n fixed-point variables, it is semantically equivalent to no game with strictly less than n-2 fixed-point variables. | |
| dc.identifier | https://arxiv.org/abs/0710.2419 | |
| dc.identifier | http://arxiv.org/abs/0710.2419 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/156704 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | Logic | |
| dc.title | The Variable Hierarchy for the Games mu-Calculus | |
| dc.type | text |