Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T13:49:51.654Z Has data issue: false hasContentIssue false

Recursive coalgebras of finitary functors

Published online by Cambridge University Press:  17 August 2007

Jiří Adámek
Affiliation:
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; adamek@iti.cs.tu-bs.de; milius@iti.cs.tu-bs.de
Dominik Lücke
Affiliation:
Department of Computer Science, University of Bremen, PO Box 330440, 28334 Bremen, Germany; luecke@tzi.de
Stefan Milius
Affiliation:
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; adamek@iti.cs.tu-bs.de; milius@iti.cs.tu-bs.de
Get access

Abstract

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.

Information

Type
Research Article
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable