The Variable Hierarchy for the Games mu-Calculus

Details The Variable Hierarchy for the Games mu-Calculus The Variable Hierarchy for the Games mu-Calculus

2007-10-12

arxiv.org/abs/0710.2419v2

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Variable Hierarchy for the Games mu-Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Variable Hierarchy for the Games mu-Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Variable Hierarchy for the Games mu-Calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-403415