μ-Bicomplete Categories and Parity Games
From MaRDI portal
Publication:4787834
DOI10.1051/ita:2002010zbMath1024.18001arXiv1610.06393OpenAlexW2593993296MaRDI QIDQ4787834
Publication date: 15 October 2003
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06393
Games involving graphs (91A43) Abstract data types; algebraic specification (68Q65) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categorical semantics of formal languages (18C50) Categories of sets, characterizations (18B05)
Related Items (10)
Conway Games, Coalgebraically ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ CHAD for expressive total languages ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Completions of \(\mu \)-algebras ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Unnamed Item ⋮ From Parity Games to Circular Proofs ⋮ Sequential algorithms and strongly stable functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong categorical datatypes II: A term logic for categorical programming
- Equational properties of iteration in algebraically complete categories
- Least fixed point of a functor
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Universal coalgebra: A theory of systems
- Pushdown processes: Games and model-checking
- Terminal coalgebras in well-founded set theory
- A fixpoint theorem for complete categories
- Elementary observations on 2-categorical limits
- Algebraic specification of data types: A synthetic approach
- Accessible Categories: The Foundations of Categorical Model Theory
- Ensembles libres de chemins dans un graphe
- A Coalgebraic View of Infinite Trees and Iteration
- Rudiments of \(\mu\)-calculus
- Iteration 2-theories
- On model checking for the \(\mu\)-calculus and its fragments
- Free \(\mu\)-lattices
This page was built for publication: μ-Bicomplete Categories and Parity Games
