Presenting Functors by Operations and Equations

Authors

Alexander Kurz, Chapman UniversityFollow
Marcello M. Bonsangue, Leiden University

Document Type

Conference Proceeding

Publication Date

2006

Abstract

We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the ‘Stone dual’ L of T. We show that such a functor always gives rise to an ‘abstract’ adequate logic for T-coalgebras and investigate under which circumstances it gives rise to a ‘concrete’ such logic, that is, a logic with an inductively defined syntax and proof system. We obtain a result that allows us to prove adequateness of logics uniformly for a large number of different types of transition systems and give some examples of its usefulness.

Comments

This paper was originally presented at International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) in 2006. DOI: 10.1007/11690634_12

Recommended Citation

Bonsangue M.M., Kurz A. (2006) Presenting Functors by Operations and Equations. In: Aceto L., Ingólfsdóttir A. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2006. Lecture Notes in Computer Science, vol 3921. Springer, Berlin, Heidelberg

Copyright

Springer