Equivalences and congruences on infinite Conway games

DOI10.1051/ITA/2012001zbMATH Open1279.68187OpenAlexW2170472627MaRDI QIDQ2889179FDOQ2889179

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

zbMATH Keywords

coalgebrasequivalencesnon-wellfounded gamesConway gamesJoyal's category

Mathematics Subject Classification ID

Applications of game theory (91A80) Other game-theoretic models (91A40) Semantics in the theory of computing (68Q55)

Cites Work

• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• Games and full completeness for multiplicative linear logic
• Complementation of Coalgebra Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extensive games as process models
• Free \(\mu\)-lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conway games, algebraically and coalgebraically

Cited In (2)

• Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games
• Multigames and strategies, coalgebraically

This page was built for publication: Equivalences and congruences on infinite Conway games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889179)