Coalgebras and Modal Logic


The Nuffield Foundation Awards to Newly Appointed Lecturers NAL/00795/G, GPB 5,000


July 2004 - June 2006


In the last decade, computer science has seen the rise of the theory of coalgebras as a new and promising approach to the study of dynamical systems. Universal coalgebra (Rutten, 2000) describes systems in terms of a very general notion of type and then studies systems of all types in a uniform way. In particular the coalgebraic notions of final semantics and coinduction have applications in such different areas, for example, automata theory, combinatorics, control theory, object-oriented programming, process calculi , probabilistic transition systems, and component-based software development. Since we are interested in the specification and verification of systems, the question arises what appropriate specification languages are and whether they can be described in a similar general and uniform way. Recent research suggests that these languages should be (variants of) modal logics. The aim of the proposed research is to explore the connections between coalgebras and modal logic.


A Kurz


Share this page:

Contact Us

Admissions Enquiries:
BSc: +44 (0) 116 252 5280
MSc: +44 (0) 116 252 2265
E: BSc
E: MSc

Departmental Enquiries:
T: +44 (0) 116 252 2129/3887
F: +44 (0) 116 252 3604

Dept of Informatics
University of Leicester
Leicester, LE1 7RH
United Kingdom


DisabledGo logo

The University of Leicester is committed to equal access to our facilities. DisabledGo has a detailed accessibility guide for the Informatics Building.