Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Logic of Coequations J. Ad'amek ?
 

Summary: A Logic of Coequations
J. Ad'amek ?
Institute of Theoretical Computer Science
Technical University
Braunschweig, Germany
adamek@iti.cs.tu­bs.de
Abstract. By Rutten's dualization of the Birkhoff Variety Theorem,
a collection of coalgebras is a covariety (i.e., is closed under coprod­
ucts, subcoalgebras, and quotients) iff it can be presented by a subset of
a cofree coalgebra. We introduce inference rules for these subsets, and
prove that they are sound and complete. For example, given a polynomial
endofunctor of a signature \Sigma , the cofree coalgebra consists of colored \Sigma ­
trees, and we prove that a set T of colored trees is a logical consequence
of a set S iff T contains every tree such that all recolorings of all its
subtrees lie in S. Finally, we characterize covarieties whose presentation
needs only n colors.
1 Introduction
In the theory of systems as coalgebras (in the category of sets) presented for
example by Jan Rutten [14], cofree coalgebras C(k) consist of ``possible behavior
patterns'' of states of systems colored by k (observable) colors. Given a system A

  

Source: Adámek, Jiri - Institut für Theoretische Informatik, Fachbereich Mathematik und Informatik, Technische Universität Braunschweig

 

Collections: Computer Technologies and Information Sciences