• Corpus ID: 14293537

Logic Column 15: Coalgebras and Their Logics

  title={Logic Column 15: Coalgebras and Their Logics},
  author={Alexander Kurz},
  • A. Kurz
  • Published 28 May 2006
  • Computer Science
  • ArXiv
This article describes recent work on the topic of specifying properties of transition systems. By giving a suitably abstract description of transition systems as coalgebras, it is possible to derive logics for capturing properties of these transition systems in an elegant way. 

Tables from this paper

The Description of Information in 4-Dimensional Pseudo-Euclidean Information Space
New method of description information systems in abstract 4-dimensional pseudo-Euclidean information space (4-DPIES) with using special relativity (SR) methods with core postulates of existence 4-DPies formulated and proved is presented.


Specifying Coalgebras with Modal Logic
  • A. Kurz
  • Computer Science, Mathematics
  • 1998
Closure properties of coalgebra automata
  • C. Kupke, Y. Venema
  • Mathematics, Computer Science
    20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
  • 2005
It is shown that for any standard, weak pullback preserving functor F, the class of recognizable languages of F -coalgebras is closed under taking unions, intersections and projections.
Automata and Coinduction (An Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to
Modular Construction of Modal Logics
This work uses coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems to derive sound, complete and expressive logics for a wide variety of probabilistic systems.
Presenting Functors by Operations and Equations
A result is obtained 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.
From modal logic to terminal coalgebras
A paradigm for program semantics - power structures and duality
This book provides a synthesis of four versions of programme semantics - relational semantics, predicate transformer semantics, information systems, and domain theory - showing that it is possible to
The Coalgebraic Class Specification Language CCSL
This note presents the Coalgebraic Class Specification Language CCSL, a specification of behavioral types or classes from object-oriented languages that is developed within the LOOP project1.