| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422493 | Electronic Notes in Theoretical Computer Science | 2007 | 25 Pages |
Abstract
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logics for their coalgebras. Examples include typical functors used to describe systems with name binding, interpreted in nominal sets.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
