On well-founded and recursive coalgebras
From MaRDI portal
Publication:2200809
DOI10.1007/978-3-030-45231-5_2zbMATH Open1455.18001arXiv1910.09401OpenAlexW3022823504MaRDI QIDQ2200809FDOQ2200809
Authors: Jiří Adámek, Stefan Milius, Lawrence S. Moss 
Publication date: 23 September 2020
Abstract: This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving endofunctors on complete and well-powered categories every coalgebra has a well-founded part, and we provide a new, shorter proof that this is the coreflection in the category of all well-founded coalgebras. We present a new more general proof of Taylor's General Recursion Theorem that every well-founded coalgebra is recursive, and we study under which hypothesis the converse holds. In addition, we present a new equivalent characterization of well-foundedness: a coalgebra is well-founded iff it admits a coalgebra-to-algebra morphism to the initial algebra.
Full work available at URL: https://arxiv.org/abs/1910.09401
Recommendations
Categorical semantics of formal languages (18C50) Abstract data types; algebraic specification (68Q65) Foundations, relations to logic and deductive systems (18A15)
Cites Work
- Semi-automated verification of security proofs of quantum cryptographic protocols
- Automated equivalence checking of concurrent quantum systems
- Quantum cryptography: public key distribution and coin tossing
- Title not available (Why is that?)
- Towards a quantum programming language
- Deciding bisimilarity and similarity for probabilistic processes.
- Polynomial time decision algorithms for probabilistic automata
- Symbolic bisimulations
- A theory of bisimulation for the \(\pi\)-calculus
- Probabilistic bisimulations for quantum processes
- Open bisimulation for quantum processes
- An algebra of quantum processes
- Bisimulation for quantum processes
- Relations among quantum processes: bisimilarity and congruence
- Communicating quantum processes
- Symbolic bisimulation for quantum processes
Cited In (13)
- A categorical framework for learning generalised tree automata
- Corecursive algebras in nature
- Recursive coalgebras of finitary functors
- Well-founded coalgebras, revisited
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- The Recursion Scheme from the Cofree Recursive Comonad
- Well-pointed coalgebras (extended abstract)
- Cofree coalgebras and multivariable recursiveness.
- Recursive coalgebras from comonads
- Recursive coalgebras from comonads
- Categorical liveness checking by corecursive algebras
- Well-pointed coalgebras
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
This page was built for publication: On well-founded and recursive coalgebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200809)
