University of Leicester

computer science

Workshop on Coalgebraic Logic

Coalgebraic Logic


Back to main workshop page


Preliminary Programme

Friday, August 10


900-1000: Dirk Pattinson Coalgebraic Logics: A Computer Science Perspective (Slides)
1000-1030: Break/Discussion
1030-1130: Larry Moss Coalgebra and Modal Logic: Notes from a Research Program (Slides)
1130-1200: Break/Discussion
1200-1300: Yde Venema A dynamic distributive law (Slides)
1230-1400: Discussion/Lunch
1400-1500: H.Peter Gumm Copower functors (Slides)
1530-1600: Break/Discussion
1600-1700: Rob Goldblatt Definable Model Classes in Polynomial Coalgebraic Logic (Slides)
1700-1715:Discussion
Time: Break/Discussion


Saturday, August 11


930-1030: Bart Jacobs Coalgebraic Trace Theory
1030-1100: Break/Discussion
1100-1245: Marcelo Fiore Tutorial: A Mathematical Theory of Substitution and its Applications to Syntax and Semantics (Slides)
1245-1415: Discussion/Lunch
1415-1630: Short presentations (Contact Alexander Kurz at the conference if your are interested in giving a short, informal presentation)

    

Abstracts


Dirk Pattinson

Title: Coalgebraic Logics: A Computer Science Perspective

Abstract: In this talk I will give an introduction to coalgebraic logics from a computer science perspective and discuss both genericity and modularity for coalgebraic logics. Lazyness being one of the prime qualifications of a computer scientist, one likes to develop algorithms and proofs that apply uniformly to a wide variety of different logics. This results, in an application context, in software tools that are easier to develop and to maintain. Modularity, on the other hand, allows us to infer properties and to synthesize algorithms for combined systems from a small number of basic building blocks. This would ideally pave the way for larger-scale applications. In the second part of the talk I want to take the opportunity to present and discuss some open problems in the area and outline some research directions.


Larry Moss

Title: Coalgebra and Modal Logic: Notes from a Research Program

Abstract: Different researchers come at one and the same subject from many points of motivation. In my case, I followed a trail to coalgbraic versions of modal logic which began from work on circularity and non-wellfounded sets. I have never had the chance to present the 'big picture' here, and so this is what I want to do in this talk. I also want to explore two of the pleasant 'small details' of the picture: one is a detour into probabilistic modal logic, a detour related to ongoing work. A second is an approach to the weak completeness of modal logics that comes from coalgebraic ideas.


Yde Venema

Title: A dynamic distributive law

Abstract:


H.Peter Gumm

Title: Copower functors

Abstract: We unify and characterize various functors representing types of generalized labeled transition systems. In particular, we are interested in the case where the transition labels carry various algebraic structures and we relate their algebraic properties to corresponding functorial properties. We also plan to discuss the correponding coalgebraic logics.


Rob Goldblatt

Title: Definable Model Classes in Polynomial Coalgebraic Logic

Abstract: Standard ideas and results (definable model classes, canonical model construction) do not lift readily from propositional modal logic to the logic of T-coalgebras when a polynomial functor T has infinite constant components. This talk will discuss ways of overcoming this obstacle by introducing modified notions of ultraproduct and ultrafilter extension, and developing an infinitary proof theory for finite formulas.


Bart Jacobs

Title: Coalgebraic Trace Theory

Abstract: This talk will give an overview of results on the coalgebraic approach to traces, as developed by Ichiro Hasuo, Ana Sokolova and the speaker. A basic ingredient is the existence of final coalgebras in Kleisli categories.


Marcelo Fiore

Title: Tutorial: A Mathematical Theory of Substitution and its Applications to Syntax and Semantics

Abstract: