The mu-calculus and the hierarchy problem

The subject of this thesis is the Mu-calculus, which nowadays represents a very active research area in both theoretical and practical Computer Science. On the technical respect, this thesis addresses a specific expressiveness problem of the Mu-calculus, the alternation depth hierarchy problem.