The following pages link to A final coalgebra theorem (Q5096269):
Displaying 31 items.
- Properties of set functors (Q2847778) (← links)
- (Q3121518) (← links)
- Bisimulations Generated from Corecursive Equations (Q3178257) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- Final Coalgebras are Ideal Completions of Initial Algebras (Q4542236) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q4571977) (← links)
- Modal Rules are Co-Implications (Q4917041) (← links)
- Modal Languages for Coalgebras in a Topological Setting (Q4917043) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Rough and Near: Modal History of Two Theories (Q5082210) (← links)
- Mongruences and cofree coalgebras (Q5096389) (← links)
- (Q5155674) (← links)
- (Q5214815) (← links)
- On Finitary Functors (Q5243045) (← links)
- Enhanced coalgebraic bisimulation (Q5361143) (← links)
- Services and Contracts: Coalgebraically (Q5415620) (← links)
- Realization of Coinductive Types (Q5739360) (← links)
- (Q5875411) (← links)
- Final universes of processes (Q5890039) (← links)
- A structural co-induction theorem (Q5890042) (← links)
- On the structure of categories of coalgebras (Q5941161) (← links)
- From modal logic to terminal coalgebras (Q5941165) (← links)
- A concrete final coalgebra theorem for ZF set theory (Q6061877) (← links)
- The eventual image (Q6593824) (← links)
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
- Monoidal streams for dataflow programming (Q6649486) (← links)
- Graded monads and behavioural equivalence games (Q6649498) (← links)
- Exact sequences in categories of coalgebras (Q6655933) (← links)
- Proving behavioural apartness (Q6666778) (← links)
