The least fibred lifting and the expressivity of coalgebraic modal logic

Lecture Notes in Computer Science

Volumn 3629, Issue , 2005, Pages 247-262

  Klin, Bartek ^a,b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; MATHEMATICAL OPERATORS; MODAL ANALYSIS; SET THEORY;

ENDOFUNCTOR B; FIBRED FUNCTORS; PULLBACK PRESERVATION; RELATION-PRESERVING FUNCTIONS;

BOOLEAN ALGEBRA;

EID: 26944447078     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11548133_16     Document Type: Conference Paper

References (18)

1. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249 (2000) 3-80
2. Park, D.M.: Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 140 (1981) 195-219
3. Milner, R.: Communication and Concurrency. Prentice Hall (1988)
4. Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Information and Computation 145 (1998) 107-152
5. Jacobs, B.: Exercises in coalgebraic specification. In Croie, R., Backhouse, R., Gibbons, J., eds.: Algebraic and Coalgebraic Metods in the Mathematics of Program C onstruction. Volume 2297 of Lecture Notes in Computer Science. Springer (2002)
6. Jacobs, B., Hughes, J.: Simulations in coalgebra. Electronic Notes in Theoretical Computer Science 82 (2003)
7. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 (1985) 137-161
8. Jacobs, B.: Towards a duality result in the modal logic for coalgebras. In: Proc. CMCS 2000. Volume 33 of Electronic Notes in Theoretical Computer Science. (2000)
9. Klin, B,: Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics. PhD thesis, BRICS, Aarhus University (2004)
10. Moss, L.: Coalgebraic logic. Annals of Pure and Applied Logic 96 (1999) 177-317
11. Pattinson, D.: Expressivity Results in the Modal Logic of Coalgebras. PhD thesis, Universität München (2001)
12. Pattinson, D.: Semantical principles in the modal logic of coalgebras. In: Proc. STACS 2001. Volume 2010 of Lecture Notes in Computer Science., Springer Verlag (2001)
13. Schröder, L.: Expressivity of coalgebraic modal logic: the limits and beyond. In: Procs. FOSSACS'05. (to appear)
14. Jacobs, B.: Trace semantics for coalgebras. In: Proc. CMCS 2004. Volume 106 of Electronic Notes in Theoretical Computer Science. (2004)
15. Jacobs, B.: Categorical Logic and Type Theory. Number 141 in Studies in Logic and the Foundations of Mathematics. North Holland (1999)
16. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Proc. CTCS'89. Volume 389 of Lecture Notes in Computer Science. (1989) 357-365
17. Thomsen, B.: A theory of higher-order communicating systems. Information and Computation 116 (1995)
18. Cirstea, C., Pattinson, D.: Modular construction of modal logic. In: Proc. CONCUR'04. Volume 3170 of Lecture Notes in Computer Science. (2004)