Recursive coalgebras of finitary functors
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; email@example.com; firstname.lastname@example.org
2 Department of Computer Science, University of Bremen, PO Box 330440, 28334 Bremen, Germany; email@example.com
Accepted: 9 February 2007
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
Mathematics Subject Classification: 18A25 / 08C05 / 68R65
Key words: Recursive coalgebra / coalgebra / definition by recursivity
© EDP Sciences, 2007