Conway Games, Coalgebraically

DOI10.1007/978-3-642-03741-2_21zbMath1239.91021OpenAlexW1595703684MaRDI QIDQ2888495

Marina Lenisa, Furio Honsell

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03741-2_21

zbMATH Keywords

Conway gameshypergamescoalgebraic gamesnon-losing strategies

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial games (91A46)

Related Items

Multigames and strategies, coalgebraically

Cites Work

• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• Games and full completeness for multiplicative linear logic
• μ-Bicomplete Categories and Parity Games
• Tools and Algorithms for the Construction and Analysis of Systems
• Graphs and composite games
• Free \(\mu\)-lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conway Games, Coalgebraically