Equivalences and Congruences on Infinite Conway Games
From MaRDI portal
Publication:2889179
DOI10.1051/ita/2012001zbMath1279.68187OpenAlexW2170472627MaRDI QIDQ2889179
Furio Honsell, Rekha Redamalla, Marina Lenisa
Publication date: 4 June 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222005
Applications of game theory (91A80) Other game-theoretic models (91A40) Semantics in the theory of computing (68Q55)
Related Items
Cites Work
- Extensive games as process models
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Complementation of Coalgebra Automata
- Conway games, algebraically and coalgebraically
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Games and full completeness for multiplicative linear logic
- Free \(\mu\)-lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equivalences and Congruences on Infinite Conway Games