Modal operators and the formal dual of Birkhoff's completeness theorem

Mathematical Structures in Computer Science

Volumn 13, Issue 2, 2003, Pages 233-258

  Awodey, Steve ^a   Hughes, Jesse ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976604452     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003894     Document Type: Article

References (45)

1. Adámek, J. and Koubek, V. (1977) Functorial algebras and automata. Kybernetika 13 245–260.
2. Adámek, J. and Porst, H.-E. (2001) From varieties of algebras to covarieties of coalgebras. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Coalgebraic methods in computer science (CMCS'2001). Electronic Notes in Theoretical Computer Science 44.
3. Adámek, J. and Rosický, J. (1994) Locally presentable and accessible categories. London Mathematical Society Lecture Note Series 189, Cambridge University Press.
4. Andréka, H. and Németi, I. (1978) Lo's lemma holds in every category. Studia Sci. Math. Hungar. 13 361–376.
5. Andréka, H. and Németi, I. (1979a) Formulas and ultraproducts in categories. Beitrage zur Algebra und Geometrie 8 133–151.
6. Andréka, H. and Németi, I. (1979b) Injectivity in categories to represent all first order formulas. Demonstratio Mathematica 12 717–732.
7. Andréka, H. and Németi, I. (1981) A general axiomatizability theorem formulated in terms of cone-injective subcategories. In: Universal Algebra (Proc. Coll. Esztergom 1977). Colloq. Math. Soc. J. Bolyai 29 13–35.
8. Andréka, H. and Németi, I. (1983) Generalization of variety and quasivariety concept to partial algebras through category theory. Dissertationes Mathematicae (Rozprawy Math.).
9. Awodey, S. and Hughes, J. (2000) The coalgebraic dual of Birkhoff's variety theorem. Technical Report CMU-PHIL-109, Carnegie Mellon University.
10. Banaschewski, B. and Herrlich, H. (1976) Subcategories defined by implications. Houston Journal of Mathematics 2 (2).
11. Barr, M. and Wells, C.F. (1990) Category Theory for Computing Science, Prentice-Hall International.
12. Birkhoff, G. (1935) On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society 31 433–454.
13. Blackburn, P., de Rijke, M. and Venema, Y. (2001) Modal Logic, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.
14. Borceux, F. (1994) Handbook of Categorical Algebra I-III, Cambridge University Press.
15. Corradini, A. (1998) A completeness result for equational deduction in coalgebraic specification. In: Recent trends in algebraic development techniques. Springer-Verlag Lecture Notes in Computer Science 1376.
16. Goldblatt, R. (2001a) Equational logic of polynomial coalgebras. Available at http://www.mcs.\breakvuw.ac.nz/~rob/.
17. Goldblatt, R. (2001b) What is the coalgebraic analogue of Birkhoff's Variety Theorem? Theoretical Computer Science 266 853–886.
18. Grätzer, G. (1968) Universal Algebra, D. Van Nostrand Company, Inc.
19. Gumm, H. P. (1999) Elements of the general theory of coalgebras. LUATCS'99, Rand Africaans University, Johannesburg, South Africa. Available at http://proof.mth.uct.ac.za/~pjipsen/luatcs99/.
20. Gumm, H. P. (2001a) Birkhoffs variety theorem for coalgebras. In: Contributions to general algebra, 13 (Velké Karlovice, 1999/Dresden, 2000), Heyn, Klagenfurt 159–173.
21. Gumm, H. P. (2001b) Equational and implicational classes of coalgebras. Coalgebraic methods in computer science (Lisbon, 1998). Theoret. Comput. Sci. 260 (1–2) 57–69.
22. Gumm, H. P. (2001c) Functors for coalgebras. Conference on lattices and universal algebra (Szeged, 1998). Algebra Universalis 45 (2–3) 135–147.
23. Gumm, H. P. and Schröder, T. (2001) Covarieties and complete covarieties. Coalgebraic methods in computer science (Lisbon, 1998) Theoret. Comput. Sci. 260 (1–2) 71–86.
24. Hughes, J. (2001) A Study of Categories of Algebras and Coalgebras, Ph. D. thesis, Carnegie Mellon University.
25. Jacobs, B. (1995) Mongruences and cofree coalgebras. In: Alagar, V. and Nivat, M. (eds.) Algebraic methodology and software technology. Springer-Verlag Lecture Notes in Computer Science 936 245–260.
26. Jacobs, B. (1999) The temporal logic of coalgebras via Galois algebras. Technical Report CSI-R9906, Computing Science Institute. (To appear in Mathematical Structures in Computer Science.)
27. Jacobs, B., Moss, L., Reichel, H. and Rutten, J. (eds.) (1998) Coalgebraic methods in computer science (CMCS'1998). Electronic Notes in Theoretical Computer Science 11.
28. Jacobs, B. and Rutten, J. (1997) A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science 62 222–259.
29. Kurz, A. (1999) Modal rules are coimplications (draft). Available at http://helios.pst.informatik.\breakuni-muenchen.de/~kurz.
30. Kurz, A. (2000) Logics for Coalgebras and Applications for Computer Science, Ph.D. thesis, Ludwig-Maximilians-Universität München.
31. Kurz, A. (2001) A co-variety-theorem for modal logic. Selected Papers from AiML 2, Uppsala, 1998. In: Advances in Modal Logic 2, Center for the Study of Language and Information, Stanford University.
32. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer-Verlag.
33. Manes, E. (1976) Algebraic Theories, Graduate Texts in Mathematics 26, Springer-Verlag.
34. Mašulović, D. (2001) Invariants of monadic coalgebras. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Coalgebraic methods in computer science (CMCS'2001). Electronic Notes in Theoretical Computer Science 44.
35. Mašulović, D. and Tasić, B. (2001) Operators on classes of coalgebras. Theoret. Comput. Sci. 269 (1–2) 419–431.
36. Meinke, K. and Tucker, J.V. (1992) Universal algebra. In: Abramsky, S., Gabbay, D.M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 1, Oxford Science Publications 189–412.
37. Németi, I. (1982) On notions of factorizations systems and their applications to cone-injective subcategories. Periodica Mathematica Hungarica 13 (3) 229–235.
38. Németi, I. and Sain, I. (1981) Cone-implicational subcategories and some Birkhoff-type theorems. In: Universal Algebra (Proc. Coll. Esztergom 1977). Colloq. Math. Soc. J. Bolyai 29 535–578.
39. Poll, E. and Zwanenburg, J. (2001) From algebras and coalgebras to dialgebras. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Coalgebraic methods in computer science (CMCS'2001). Electronic Notes in Theoretical Computer Science 44.
40. Reichel, H. (ed.) (2000) Coalgebraic methods in computer science (CMCS'2000). Electronic Notes in Theoretical Computer Science 33.
41. Roşu, G. (to appear) Axiomatizability in inclusive equational logics. Mathematical Structures in Computer Science. (Available from http://ase.arc.nasa.gov/grosu/iel.ps.)
42. Roşu, G. (2000) Equational axiomatizability for coalgebra. Theoretical Computer Science 260.
43. Rothe, J., Tews, H. and Jacobs, B. (2001) The coalgebraic class specification language CCSL. Journal of Universal Computer Science 7 (2) 175–193.
44. Rutten, J. (2000) Universal coalgebra: a theory of systems. Theoretical Computer Science 249 3–80.
45. Wechler, W. (1992) Universal algebra for computer scientists, Springer-Verlag.