Modal rules are co-implications

Electronic Notes in Theoretical Computer Science

Volumn 44, Issue 1, 2001, Pages 241-253

  Kurz, Alexander ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

EQUATIONAL LOGIC; KRIPKE FRAMES; MODAL LOGIC; MODAL RULES;

BOOLEAN ALGEBRA;

EID: 18944393714     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80911-3     Document Type: Conference Paper

References (20)

1. Aczel Peter. Non-Well-Founded Sets. Center for the Study of Language and Information. 1988;Stanford University
2. Aczel Peter, Mendler Nax. A final coalgebra theorem. Pitt D.H., et al. Category Theory and Computer Science, volume 389 of LNCS. 1989;357-365 Springer
3. Banaschewski B., Herrlich H. Subcategories defined by implications. Houston Journal of Mathematics. 2:(2):1976;149-171
4. Borceux Francis. Handbook of Categorical Algebra. 1994;Cambridge University Press
5. Robert Goldblatt. What is the coalgebraic analogue of Birkhoff's variety theorem? Theoretical Computer Science. To appear.
6. Gumm H.P., Schröder T. Covarieties and complete covarieties. Jacobs B., Moss L., Reichel H., Rutten J. Coalgebraic Methods in Computer Science (CMCS'98), volume 11 of Electronic Notes in Theoretical Computer Science. 1998
7. Gumm H.P., Schröder T. Coalgebraic structure from weak limit preserving functors. Jacobs B., Moss L., Reichel H., Rutten J. Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science. 2000;113-134
8. H. Peter Gumm. Equational and implicational classes of co-algebras. Extended abstract. RelMiCS'4. The 4th International Seminar on Relational Methods in Logic, Algebra and Computer Science, Warsaw, 1998.
9. Bart Jacobs. The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute Nijmegen, 1999.
10. Jacobs Bart. Towards a duality result in coalgebraic modal logic. Reichel Horst. Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science. 2000;163-198
11. Kröger Fred. Temporal Logic of Programs. 1987;Springer
12. Alexander Kurz. Specifying coalgebras with modal logic. Theoretical Computer Science, 260(1-2). To appear.
13. Alexander Kurz. A co-variety-theorem for modal logic. In Proceedings of Advances in Modal Logic 2, Uppsala, 1998. Center for the Study of Language and Information, Stanford University, 2000.
14. Alexander Kurz. Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig-Maximilians-Universität München, 2000. http://www.informatik.uni-muenchen.de/~kurz.
15. Moss Lawrence. Coalgebraic logic. Annals of Pure and Applied Logic. 96:1999;277-317
16. Dirk Pattinson. Semantical principles in the modal logic of coalgebras. In Proceedings 18th International Symposium on Theoretical Aspects of Computer Science (STACS 2001), Lecture Notes in Computer Science, Berlin, 2001. Springer. To appear.
17. Martin Rößiger. From modal logic to terminal coalgebras. Theoretical Computer Science, 260(1-2). To appear.
18. Rößiger Martin. Coalgebras and modal logic. Reichel Horst. Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science. 2000;299-320
19. Rutten J.J.M.M. Universal coalgebra: A theory of systems. Theoretical Computer Science. 249:2000;3-80
20. Wechler Wolfgang. Universal Algebra for Computer Scientists, volume 25 of EATCS Monographs on Theoretical Computer Science. 1992;Springer