Coalgebras and modal logic

Electronic Notes in Theoretical Computer Science

Volumn 33, Issue , 2000, Pages 294-315

  Rößiger, Martin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; DYNAMIC PROGRAMMING; POLYNOMIALS; SEMANTICS;

CONSTANT SETS; LOGICAL EQUIVALENCE; MODAL LANGUAGES; MODAL LOGIC;

FORMAL LOGIC;

EID: 18944403292     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80353-6     Document Type: Conference Paper

References (23)

1. A. BALTAG, Truth-as-simulation: towards a coalgebraic perspective on logic and games, ENTCS. To appear.
2. Corradini A. A complete calculus for equational deduction in coalgebraic specification. Report SEN-R 9723, National Research Institute for Mathematics and Computer Science, Amsterdam. 1997
3. Goldblatt R. Logics of time and computation. CSLI Lecture Notes. 7:1987;CSLI, Stanford
4. H.P. GUMM, Equational and Implicational Classes of Coalgebras, TCS. To appear.
5. Hensel U., Reichel H. Defining equations in terminal coalgebras. Astesiano E., Reggio G., Tarlecki A. Recent Trends in Data Type Specification, LNCS. 906:1995;307-318 Springer
6. Jacobs B. Mongruences and cofree coalgebras. Alagar V.S., Nivat M. Algebraic Methods and Software Technology, LNCS. 936:1995;245-260 Springer
7. Jacobs B. Objects and classes, co-algebraically. Freitag B., Jones C.B., Lengauer C., Schek H.-J. Object-Orientation with Parallelism and Persistence. 1996;83-103 Kluwer Acad. Publ
8. Jacobs B. The temporal logic of coalgebras via Galois algebras. Technical Report CSI-R9906, Computing Science Institute, University of Nijmegen. 1999
9. Kripke S.A. A completeness theorem in modal logic. J. Symbolic Logic. 24:1959;1-14
10. Kripke S.A. Semantic analysis of modal logic I: normal propositional calculi. Zeit. Math. Logik Grund. Math. 9:1963;67-96
11. A. KURZ, A Co-variety-theorem for modal logic, Proceedings of Advances in Modal Logic, Uppsala, CSLI, Stanford, 1998. To appear.
12. Kurz A. Specifying coalgebras with modal logic. ENTCS. 11:1998;57-71
13. Montanari A., De Rijke M. Two-sorted metric temporal logics. Theor. Comp. Sci. 183:(2):1997;187-214
14. L. MOSS, Coalgebraic logic, Ann. Pure and Appl. Logic. To appear.
15. Popkorn S. First steps in modal logic. 1994;Cambridge University Press
16. Reichel H. Nested Sketches. Technical Report ECS-LFCS-98-401, University of Edinburgh. 1998
17. M. RÖSSIGER, From modal logic to terminal coalgebras, TCS. To appear.
18. Rössiger M. Languages for coalgebras on datafunctors. ENTCS. 19:1999;55-76
19. J. RUTTEN, Universal coalgebra: a theory of systems, TCS. To appear.
20. Stirling C. Modal and temporal logics for processes. LNCS. 1043:1996;149-237
21. M.Y. VARDI, Alternating automata: unifying truth and validity for temporal logics. In: Proc. 14th International Conference on Automated Deduction, W. McCune (ed.), LNCS 1249, Springer 1997, pp. 191-206.
22. Venema Y. Points, lines and diamonds: a two-sorted modal logic for projective planes. Technical Report ML-1998-04, Institute for Logic, Language and Computation, University of Amsterdam. 1998
23. Y. VENEMA, personal communications.