The modal mu-calculus alternation hierarchy is strict

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

One of the open questions about the modal mu-calculus is whether the alternation hierarchy collapses; that is, whether all modal fix-point properties can be expressed with only a few alternations of least and greatest fix-points. In this paper, we resolve this question by showing that the hierarchy does not collapse.
Original languageEnglish
Title of host publicationCONCUR '96: Concurrency Theory
Subtitle of host publication7th International Conference Pisa, Italy, August 26–29, 1996 Proceedings
EditorsUgo Montanari, Vladimiro Sassone
PublisherSpringer Berlin Heidelberg
Number of pages14
ISBN (Electronic)978-3-540-70625-0
ISBN (Print)978-3-540-61604-7
Publication statusPublished - 1996

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg

Keywords / Materials (for Non-textual outputs)

  • temporal logic
  • mu-calculi
  • hierarchies
  • alternation


Dive into the research topics of 'The modal mu-calculus alternation hierarchy is strict'. Together they form a unique fingerprint.

Cite this