Universal coalgebra: a theory of systems

By Jan J. M. M. Rutten. Theoretical Computer Science, 2000

1,435 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/5f1579ca09e07db41aba70bf3cec8ba980e98ffc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Tobias Schröder
2. H. Peter Gumm

In Computational Theory and Mathematics

1. H. Peter Gumm
2. Tobias Schröder

Citations in the corpus

• Products of coalgebras (2001, background): “In [ Rut96 ] a criterion for the existence of cofree coalgebras is formulated as a boundedness condition on the type functor: F is called bounded if there is a cardinality bound on the size of all one-generatedF -coalgebras.”