Expressivity of coalgebraic modal logic: The limits and beyond

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 440-454

  Schröder, Lutz ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CLASSIFICATION (OF INFORMATION); EQUIVALENCE CLASSES; FUNCTION EVALUATION; MATHEMATICAL OPERATORS; MODAL ANALYSIS;

FUNCTORS; MODAL LOGIC; MODAL OPERATORS;

FORMAL LOGIC;

EID: 24644449797     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_28     Document Type: Conference Paper

References (25)

1. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (1993), 299-315.
2. F. Bartels, A. Sokolova, and E. de Vink, A hierarchy of probabilistic system types, Coalgebraic Methods in Computer Science, ENTCS, vol. 82, Elsevier, 2003.
3. B. Chellas, Modal logic, Cambridge, 1980.
4. C. Cîrstea, A compositional approach to defining logics for coalgebras, Theoret. Comput. Sci. 327 (2004), 45-69.
5. C. Cîrstea and D. Pattinson, Modular construction of modal logics, Concurrency Theory, LNCS, vol. 3170, Springer, 2004, pp. 258-275.
6. G. D'Agostino and A. Visser, Finality regained: A coalgebraic study of Scott-sets and multisets, Arch. Math. Logic 41 (2002), 267-298.
7. H. H. Hansen and C. Kupke, A coalgebraic perspective on monotone modal logic, Coalgebraic Methods in Computer Science (J. Adámek and S. Milius, eds.), ENTCS, vol. 106, Elsevier, 2004, pp. 121-143.
8. M. Hennessy and R. Milner, Algebraic laws for non-determinism and concurrency, J. ACM 32 (1985), 137-161.
9. B. Jacobs, Towards a duality result in the modal logic of coalgebras, Coalgebraic Methods in Computer Science, ENTCS, vol. 33, Elsevier, 2000.
10. B. Jónnson and A. Tarski, Boolean algebras with operators I, Amer. J. Math. 73 (1951), 891-939.
11. B. Klin, A coalgebraic approach to process equivalence and a coinduction principle for traces, Coalgebraic Methods in Computer Science, ENTCS, vol. 106, Elsevier, 2004, pp. 201-218.
12. A. Kurz, Logics for coalgebras and applications to computer science, Ph.D. thesis, Universität München, 2000.
13. _, Specifying coalgebras with modal logic, Theoret. Comput. Sci. 260 (2001), 119-138.
14. _, Logics admitting final semantics, Foundations of Software Science and Computation Structures, LNCS, vol. 2303, Springer, 2002, pp. 238-249.
15. K. Larsen and A. Skou, Bisimulation through probabilistic testing, Inform. Comput. 94 (1991), 1-28.
16. L. Moss, Coalgebraic logic, Ann. Pure Appl. Logic 96 (1999), 277-317.
17. T. Mossakowski, L. Schröder, M. Roggenbach, and H. Reichel, Algebraic-co-algebraic specification in COCASL, J. Logic Algebraic Programming, to appear.
18. D. Pattinson, Expressivity results in the modal logic of coalgebras, Ph.D. thesis, Universität München, 2001.
19. _, Semantical principles in the modal logic of coalgebras, Symposium on Theoretical Aspects of Computer Science, LNCS, vol. 2010, Springer, 2001, pp. 514-526.
20. _, Expressive logics for coalgebras via terminal sequence induction, Notre Dame J. Formal Logic 45 (2004), 19-33.
21. J. Power and H. Watanabe, An axiomatics for categories of coalgebras, Coalgebraic Methods in Computer Science, ENTCS, vol. 11, Elsevier, 2000.
22. M. Rößiger, Coalgebras and modal logic, Coalgebraic Methods in Computer Science, ENTCS, vol. 33, Elsevier, 2000.
23. J. Rothe, H. Tews, and B. Jacobs, The Coalgebraic Class Specification Language CCSL, J. Universal Comput. Sci. 7 (2001), 175-193.
24. J. Rutten, Universal coalgebra: A theory of systems, Theoret. Comput. Sci. 249 (2000), 3-80.
25. J. Siekmann and P. Szabo, A noetherian and confluent rewrite system for idempotent semigroups, Semigroup Forum 25 (1982), 83-110.