Simplifying the modal mu-calculus alternation hierarchy

  • J. C. Bradfield
Logic I

DOI: 10.1007/BFb0028547

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)
Cite this paper as:
Bradfield J.C. (1998) Simplifying the modal mu-calculus alternation hierarchy. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg

Abstract

In [Bra96], the strictness of the modal mu-calculus alternation hierarchy was shown by transferring a hierarchy from arithmetic; the latter was a corollary of a deep and highly technical analysis of [Lub93]. In this paper, we show that the alternation hierarchy in arithmetic can be established by entirely elementary means; further, simple examples of strict alternation depth n formulae can be constructed, which in turn give very simple examples to separate the modal hierarchy. In addition, the winning strategy formulae of parity games are shown to be such examples.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • J. C. Bradfield
    • 1
  1. 1.Department of Computer Science, University of EdinburghLaboratory for Foundations of Computer ScienceEdinburghUK

Personalised recommendations