Coalgebraic modal logic of finite rank

Mathematical Structures in Computer Science

Volumn 15, Issue 3, 2005, Pages 453-473

  Kurz, Alexander ^a   Pattinson, Dirk ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750695655     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004755     Document Type: Conference Paper

References (29)

1. Adámek J., Herrlich H. and Strecker G. (1990) Abstract and Concrete Categories, John Wiley & Sons.
2. Adámek J. and Koubek V. (1995) On the greatest fixed point of a set functor. Theoretical Computer Science 150 57-75.
3. Barr, M. (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 (2) 299-315.
4. Blackburn, P., de Rijke, M. and Venema, Y. (2001) Modal Logic, Cambridge University Press.
5. Engelking, R. (1989) General Topology, Heldermann Verlag.
6. Gerbrandy, J. (1999) Bisimulations on Planet Kripke, Ph.D. thesis, University of Amsterdam.
7. Goldblatt, R. (1992) Logics of Time and Computation (second edition). CSLI Lecture Notes 1, Center for the Study of Language and Information, Stanford University.
8. Jacobs, B. (1999) The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute Nijmegen.
9. Jacobs, B. (2001) Many-sorted coalgebraic modal logic: a model-theoretic study. Theoretical Informatics and Applications 35 (1) 31-59.
10. Kelley, J. (1955) General Topology, Springer.
11. Kröger, F. (1987) Temporal Logic of Programs, Springer.
12. Kurz, A. (2000) Logics for Coalgebras and Applications to Computer Science, Ph.D. thesis, Ludwig-Maximilians-Universität München.
13. Kurz, A. (2001a) A co-variety-theorem for modal logic. In: Zakharyaschev, M., Segerberg, K., de Rijke, M. and Wansing, H. (eds.) Advances in Modal Logic 2, Center for the Study of Language and Information, Stanford University.
14. Kurz, A. (2001b) Modal rules are co-implications. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science 44(1).
15. Kurz, A. (2001c) Specifying coalgebras with modal logic. Theoretical Computer Science 260 119-138.
16. Kurz, A. and Pattinson, D. (2002) Definability, canonical models, compactness for finitary coalgebraic modal logic. In: Moss, L. (ed.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science 65 (1).
17. Manna, Z. and Pnueli, A. (1992) The Temporal Logic of Reactive and Concurrent Systems, Springer.
18. Smyth, M. (1993) Topology. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 1, Oxford University Press.
19. Moss, L. (1999) Coalgebraic logic. Annals of Pure and Applied Logic 96 277-317.
20. Pattinson, D. (2001) Semantical principles in the modal logic of coalgebras. In: Proceedings 18th International Symposium on Theoretical Aspects of Computer Science (STAGS 2001). Springer-Verlag Lecture Notes in Computer Science 2010.
21. Pattinson, D. (2003) Coalgebraic Modal Logic: Soundness, Completeness and Decidablility of Local Consequence. Theoretical Computer Science 309 (1-3) 177-193.
22. Pattinson, D. (2004) Expressive logics for coalgebras via terminal sequence induction. Notre Dame Journal of Formal Logic 45 (1) 19-33.
23. Pavlovic, D. and Pratt, V. (2000) On coalgebra of real numbers. In: Jacobs, B. and Rutten, J. (eds.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science 19.
24. Rößiger, M. (2000) Coalgebras and modal logic. In: Reichel, H. (ed.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science 33.
25. Rößiger, M. (2001) From modal logic to terminal coalgebras. Theoretical Computer Science 260 209-228.
26. Rutten, J. J. M. M. (2000) Universal coalgebra: A theory of systems. Theoretical Computer Science 249 3-80.
27. Vickers, S. (1998) Topology Via Logic, Cambridge University Press.
28. Worrell, J. (1999) Terminal sequences for accessible endofunctors. In: Jacobs, B. and Rutten, J. (eds.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science 19.
29. Worrell, J. (2000) On Coalgebras and Final Semantics, Ph.D. thesis, Oxford University Computing Laboratory.