BLC 2010
Coalgebraic Logic: Stone Duality and Presentation of Functors
Alexander Kurz
Just as algebras, co-algebras are fundamental structures in mathematics
and computer science. Roughly speaking, in computer science, algebras
describe finitarily constructed data; coalgebras describe how to
deconstruct (or observe) the ongoing and potentially infinite behaviour
of processes. Whereas both the notion of data structure and the notion
of process are well established, it became clear only more recently they
are, to some extent, mathematically dual structures. This talk will
first introduce this duality from a computer science point of view and
then use it to set up a uniform theory of logics of coalgebras.