Abstract
We investigate the relation between the set-theoretical description of coinduction based on Tarski Fixpoint Theorem, and the categorical description of coinduction based on coalgebras. In particular, we introduce set-theoretic generalizations of the coinduction proof principle, in the spirit of Milner's bisimulation “up-to”, and we discuss categorical counterparts for these. Moreover, we investigate the connection between these and the equivalences induced by T-coiterative functions. These are morphisms into final coalgebras, satisfying the T-coiteration scheme, which is a generalization of the corecursion scheme. We show how to describe coalgebraic F-bisimulations as set-theoretical ones. A list of examples of set-theoretic coinductions which appear not to be easily amenable to coalgebraic terms are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
