Abstract
One of the open questions about the modal mu-calculus is whether the alternation hierarchy collapses; that is, whether all modal fixpoint properties can be expressed with only a few alternations of least and greatest fixpoints. In this paper, we resolve this question by showing that the hierarchy does not collapse.
| Original language | English |
|---|---|
| Pages (from-to) | 133 - 153 |
| Number of pages | 21 |
| Journal | Theoretical Computer Science |
| Volume | 195 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 30 Mar 1998 |
Keywords / Materials (for Non-textual outputs)
- Fixpoints
- Expressivity
- Temporal logic
- mu-Calculus