Coalgebraic Modal Logic Beyond Sets

Electronic Notes in Theoretical Computer Science

Volumn 173, Issue SPEC. ISS., 2007, Pages 177-201

  Klin, Bartek ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

coalgebra; locally presentable category; modal logic

Indexed keywords

COALGEBRA; LOCALLY PRESENTABLE CATEGORY; MODAL LOGIC;

ALGEBRA; FORMAL LOGIC; SET THEORY;

MODAL ANALYSIS;

EID: 33847663823     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.034     Document Type: Article

References (30)

1. Adámek J. On final coalgebras of continuous functors. Theoretical Computer Science 294 (2003) 3-29
2. Adámek J., Herrlich H., and Strecker G.E. Abstract and Concrete Categories (1990), Wiley-Interscience
3. Adámek J., and Rosický J. Locally Presentable and Accessible Categories (1994), Cambridge University Press
4. Barr M. Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 (1993) 299-315
5. Bonsangue M., and Kurz A. Pi-calculus in logical form. Draft available from. http://www.cs.le.ac.uk/people/akurz/works.html
6. Bonsangue M., and Kurz A. Duality for logics of transition systems. Proc. FOSSACS'05. LNCS volume 3441 (2005) 455-469
7. Bonsangue M., and Kurz A. Presenting functors by operations and equations. Proc. FOSSACS'06. LNCS volume 3921 (2006) 172-186
8. Dam M. Proof systems for pi-calculus logics. In: de Queiroz R. (Ed). Logic for Concurrency and Synchronisation. Trends in Logic, Studia Logica Library (2003), Kluwer 145-212
9. Fiore M., and Staton S. Comparing operational models of name-passing process calculi. Information and Computation 204 (2006) 524-560
10. Fiore M., and Staton S. A congruence rule format for name-passing process calculi from mathematical structural operational semantics. Proc. LICS'06 (2006), IEEE Computer Society Press 49-58
11. Fiore M.P., and Turi D. Semantics of name and value passing. Proc. LICS'01 (2001), IEEE Computer Society Press 93-104
12. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001) 341-363
13. van Glabbeek R.J. The linear time - branching time spectrum I. In: Bergstra J.A., Ponse A., and Smolka S. (Eds). Handbook of Process Algebra (1999), Elsevier
14. Hennessy M., and Milner R. Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 (1985) 137-161
15. Jacobs B. Towards a duality result in the modal logic for coalgebras. Proc. CMCS 2000. ENTCS 33 (2000) 160-195 Elsevier
16. Jacobs B., and Rutten J.J.M.M. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS 62 (1996)
17. Jonsson B., Yi W., and Larsen K.G. Probabilistic extensions of process algebras. In: Bergstra J.A., Ponse A., and Smolka S. (Eds). Handbook of Process Algebra (2002), Elsevier 685-710
18. Klin B. The least fibred lifting and the expressivity of coalgebraic modal logic. Proc. CALCO 2005. LNCS volume 3629 (2005) 247-262
19. Kurz A. Specifying coalgebras with modal logic. Theoretical Computer Science 260 (2001) 119-138
20. Kurz A. Coalgebras and their logics. ACM SIGACT News 37 (2006)
21. Kurz A., and Rosický J. Strongly complete logics for coalgebras. To appear. Draft available from. http://www.cs.le.ac.uk/people/akurz/
22. Mac Lane S. Categories for the Working Mathematician. second edition (1998), Springer
23. Makkai M., and Paré R. Accessible Categories: The Foundations of Categorical Model Theory. Contemporary Mathematics volume 104 (1989), American Mathematical Society
24. Milner R., Parrow J., and Walker D. Modal logics for mobile processes. Theoretical Computer Science 114 1 (1993) 149-171
25. Moss L. Coalgebraic logic. Annals of Pure and Applied Logic 96 (1999) 177-317
26. Pattinson D. Semantical principles in the modal logic of coalgebras. Proc. STACS 2001. LNCS volume 2010 (2001), Springer
27. Pavlovic D., Mislove M., and Worrell J.B. Testing semantics: connecting processes and process logics. Proc. AMAST'05. LNCS volume 4019 (2005), Springer 308-322
28. Rößiger M. Coalgebras and modal logic. Proc. CMCS 2000. ENTCS 33 (2000) Elsevier
29. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Theoretical Computer Science 249 (2000) 3-80
30. Schröder L. Expressivity of coalgebraic modal logic: the limits and beyond. Proc. FOSSACS'05. LNCS volume 3441 (2005) 470-484