Coalgebraic logic

Annals of Pure and Applied Logic

Volumn 96, Issue 1-3, 1999, Pages 277-317

  Moss, Lawrence S ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Characterization theorem; Coalgebra; Functor on sets; Greatest fixed point; Infinitary modal logic

Indexed keywords

EID: 0033095780     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00042-6     Document Type: Article

References (22)

1. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes Number, vol. 14, CSLI Publications, Stanford, 1988.
2. P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt et al. (Eds.), Category Theory and Computer Science, Springer, Heidelberg, 1989, pp. 357-365.
3. S. Aliyari, Personal correspondence. Email message of 24 September, 1997.
4. A. Baltag, Alexandru, Modal characterisation for sets and Kripke models. Unpublished manuscript, Indiana University, 1996.
5. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114(2) (1993) 299-315.
6. M. Barr, Additions and corrections to "terminal coalgebras in well-founded set theory", Theoret. Comput. Sci. 124(1) (1994) 189-192.
7. R. Blute, J. Desharnais, A. Edalat, P. Panangaden, Bisimulation for labeled Markov processes, Technical Report, BRICS, Aarhus, Denmark, 1996. Paper also to appear in the proceedings of the 1997 CSL meeting.
8. J. Barwise, L.S. Moss, Vicious Circles, CSLI Publications Number 60, Stanford, 1996.
9. J. Barwise, L.S. Moss, Modal correspondence for models, in: P. Dekker, M. Stokhof (Eds.), Proc. 10th Amsterdam Colloquium, ILLC/Department of Philosophy, University of Amsterdam, 1996, pp. 41-56.
10. J. van Benthem, Modal correspondence theory, Ph.D. Thesis, Department of Mathematics, University of Amsterdam, 1976.
11. A. Corradini, A complete calculus for equational deduction in coalgebraíc specification, Technical Report, CWI, Amsterdam, 1997.
12. R. Fagin, A quantitative analysis of modal logic, J. Symbolic Logic 59(1) (1994) 209-252.
13. J. Gerbrandy, Characterizations of bisimulation and bounded bisimulations, in: M. de Rijke (Ed.), Workshop Proc. on Observational Equivalence and Logical Equivalence, European Summer School on Logic, Language, and Information, Prague, 1996.
14. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. Comput. 94 (1991) 1-28.
15. L.S. Moss, N. Danner, On the foundations of corecursion, Logic J. IGPL 5(3) (1997) 231-257.
16. M.W. Mislove, L.S. Moss, F.J. Oles, Non-well-founded sets modeled as ideal fixed points. Inform. Comput. 93(1) (1991) 16-54.
17. L. Paulson, A concrete final coalgebra theorem for ZF set theory, in: P. Dybjer, B. Nordstrom, J. Smith (Eds.), Types for Proofs and Programs '94, Lecture Notes in Computer Science, vol. 995, Springer, Berlin, 1995, pp. 120-139.
18. J.J.M.M. Rutten, A calculus of transition systems: towards universal coalgebra, in: A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra: a Bisimulation Perspective. CSLI Lecture Notes, vol. 53, Stanford, 1995.
19. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, CWI Report CS-R9652, CWI Computer Science Department, Amsterdam, 1996.
20. D. Turi, Functorial operational semantics and its denotational dual, Ph.D. Thesis, CWI, Amsterdam, 1976.
21. D. Turi, J.J.M.M. Rutten, On the foundations of final semantics: non-standard sets, metric spaces, partial orders. Revised version of a paper with the same title, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. REX Workshop on Semantics: Foundations and Applications, Lecture Notes in Computer Science, vol. 666, Springer, Berlin, 1993, pp. 477-530.
22. E.P. de Vink, J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela, (Eds.), Proc. 24th ICALP'97, 1256, Springer, Berlin, 1997, pp. 460-470.