Ambiguous classes in the games μ-calculus hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 70-86

  Arnold, André ^a   Santocanale, Luigi ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; GAME THEORY; TEMPORAL LOGIC;

ALTERNATION-DEPTH HIERARCHY; COMPLETE LATTICES; DISTRIBUTIVE LATTICE; FIXED POINTS; MU-CALCULUS; NON-DISTRIBUTIVE LATTICE; PARITY GAMES;

EQUIVALENCE CLASSES;

EID: 21144437514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_5     Document Type: Article

References (23)

1. A. Arnold. The μ-calculus alternation-depth hierarchy is strict on binary trees. Theor. Inform. Appl., 33(4-5):329-339, 1999.
2. A. Arnold and D. Niwinski. Fixed point characterization of weak monadic logic definable sets of trees. In Tree automata and languages (Le Touquet, 1990), volume 10 of Stud. Comput. Sci. Artificial Intelligence, pages 159-188. North-Holland, Amsterdam, 1992.
3. A. Arnold and D. Niwiński. Rudiments of μ-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 2001.
4. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial information. To appear in Theoret. Comput. Sci., 2002.
5. A. Blass. A game semantics for linear logic. Ann. Pure Appl. Logic, 56(1-3):183-220, 1992.
6. J. C. Bradfield. The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci., 195(2):133-153, 1998.
7. G. D'Agostino and M. Hollenberg. Logical questions concerning the μ-calculus: interpolation, Lyndon and łoś-Tarski. J. Symbolic Logic, 65(1):310-332, 2000.
8. M. Dziembowski, S. Jurdziński and I. Walukiewicz. How much memory is needed to win infinite games? In Twelth Annual IEEE Symposium on Logic in Computer Science, pages 99-110. IEEE Computer Society Press, 1997.
9. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model checking for the μ-calculus and its fragments. Theoret. Comput. Sci., 258(1-2):491-522, 2001.
10. R. Freese, J. Ježek, and J. B. Nation. Free lattices. American Mathematical Society, Providence, RI, 1995.
11. A. Joyal. Free lattices, communication and money games. In Logic and scientific methods (Florence, 1995), pages 29-68. Kluwer Acad. Publ., Dordrecht, 1997.
12. A. S. Kechris. Classical descriptive set theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995.
13. G. Lenzi. A hierarchy theorem for the μ-calculus. In Automata, languages and programming (Paderborn, 1996), volume 1099 of Lecture Notes in Comput. Sci., pages 87-97. Springer, Berlin, 1996.
14. A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Computation theory (Zaborow, 1984), volume 208 of Lect. Notes in Comput. Sci., pages 157-168. Springer, Berlin, 1985.
15. D. Niwinski. On fixed-point clones. In Automata, languages and programming, volume 226 of Lecture Notes in Comput. Sci., pages 464-473, 1986.
16. D. Niwinski. Fixed point characterization of infinite behavior of finite-state systems. Theoret. Comput. Sci., 189(1-2): 1-69, 1997.
17. D. Niwinski and I. Walukiewicz. Relating hierarchies of word and tree automata. In STACS 98 (Paris, 1998), volume 1373 of Lecture Notes in Comput. Sci., pages 320-331. Springer, Berlin, 1998.
18. L. Santocanale. The alternation hierarchy for the theory of μ-lattices. Theory and Applications of Categories, 9:166-197, January 2002.
19. L. Santocanale. A calculus of circular proofs and its categorical semantics. In FOSSACS02, volume 2303 of Lecture Notes in Comput. Sci., pages 357-371, 2002.
20. L. Santocanale. Free μ-lattices. J. Pure Appl. Algebra, 168(2-3):227-264, 2002.
21. L. Santocanale. Parity games and μ-bicomplete categories. Theor. Inform. Appl., (36):195-227, 2002.
22. G. Takeuti. Proof theory. North-Holland Publishing Co., Amsterdam, 1975. Studies in Logic and the Foundations of Mathematics, Vol. 81.
23. W. Thomas. Languages, automata, and logic. In Rozenberg G. and Salomaa A., editors, Handbook of Formal Language Theory, volume III, pages 389-455. Springer-Verlag, New York, 1996.