The variable hierarchy of the μ-calculus is strict

Theory of Computing Systems

Volumn 40, Issue 4, 2007, Pages 437-466

  Berwanger, Dietmar ^a   Gradel, Erich ^a   Lenzi, Giacomo ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATION HIERARCHIES;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

CALCULATIONS;

EID: 34547177338     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1317-8     Document Type: Conference Paper

References (20)

1. A. Arnold, The μ-calculus alternation-depth is strict on binary trees, RAIRO Informatique Théorique et Applications, 33 (1999), 329-339.
2. A. Arnold and D. Niwiński, Rudiments of μ-Calculus, North-Holland, Amsterdam., 2001.
3. D. Berwanger, Game logic is strong enough for parity games, Studia Logica, 75 (2003), 205-219. Special issue on Game Logic and Game Algebra edited by M. Pauly and R. Parikh.
4. D. Berwanger and E. Grädel, Games and model checking for guarded logics, in Proceedings of LPAR 2001, vol. 2250 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001, pp. 70-84.
5. D. Berwanger, E. Grädel, and G. Lenzi, On the variable hierarchy of the modal μ-calculus, in Computer Science Logic, CSL 2002, J. Bradfield, ed., vol. 2471 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2002, pp. 352-366.
6. J. Bradfield, The modal μ-calculus alternation hierarchy is strict, Theoretical Computer Science, 195 (1998), 133-153.
7. A. Emerson and C. Jutla, Tree automata, μ-calculus and determinacy, in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 368-377.
8. G. Gottlob, N. Leone, and R Scarcello, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width, in Proceedings of the 20th ACM Symposium on Principles of Database Systems, 2001, pp. 195-201.
9. D. Janin and G. Lenzi, On the logical definability of topologically closed recognizable languages of infinite trees, Computing and Informatics, 21 (2002), 185-203.
10. T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed tree-width, Journal of Combinatorial Theory, Series B, 82 (2001), 138-154.
11. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27 (1983), 333-354.
12. D. Kozen, A finite model theorem, for the propositional μ-calculus, Studia Logica, 47 (1988), 233-241.
13. O. Kupferman, M. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the ACM, 47 (2000), 312-360.
14. G. Lenzi, A hierarchy theorem for the mu-calculus, in Proceedings of the 23rd International Colloquium on Automata, Languages and Programming ICALP '96, R Meyer auf der Heide and B. Monien, eds., vol. 1099 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, July 1996, pp. 87-97.
15. R. Parikh, Propositional game logic, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 1983, pp. 195-200.
16. R. Parikh, The logic of games and its applications, Annals of Discrete Mathematics, 24 (1985), 111-140.
17. M. Pauly, Logic for Social Software, Ph.D. thesis, University of Amsterdam, 2001.
18. P. D. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, Journal of Combinatorial Theory, Series B, 58 (1993), 22-33.
19. C. Stirling, Bisimulation, modal logic and model checking games, Logic Journal of the IGPL, 7 (1999), 103-124.
20. P. Wolper, Temporal logic can be more expressive, Information and Control, 56 (1983), 72-99.