Document Type
Article
Publication Date
2006
Abstract
"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."
Recommended Citation
A. Kurz, “Coalgebras and their logics,” ACM SIGACT News, vol. 37, no. 2, p. 57, Jun. 2006. DOI: 10.1145/1140612.1140628
Copyright
Association for Computing Machinery
Included in
Algebra Commons, Logic and Foundations Commons, Other Computer Engineering Commons, Other Computer Sciences Commons, Other Mathematics Commons
Comments
© ACM, 2006. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGACT News, volume 37, issue 2, in 2006. DOI: 10.1145/1140612.1140628