Equivalences and congruences on infinite Conway games
type: Item
instance of: scholarly article
zbMATH Open document ID: 1279.68187
author: Furio Honsell
author: Marina Lenisa
author: Rekha Redamalla
publication date: 2012-06-04T00:00:00Z
full work available at URL: https://eudml.org/doc/222005
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6042919
zbMATH Keywords: Conway games
zbMATH Keywords: non-wellfounded games
zbMATH Keywords: coalgebras
zbMATH Keywords: equivalences
zbMATH Keywords: Joyal's category
MaRDI profile type: Publication
OpenAlex ID: W2170472627
cites work: Games and full completeness for multiplicative linear logic
cites work: Q3992552
cites work: Q4717366
cites work: Q4099541
cites work: Q3328538
cites work: When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
cites work: Conway games, algebraically and coalgebraically
cites work: Complementation of Coalgebra Automata
cites work: Q4355684
cites work: An Explicit Formula for the Free Exponential Modality of Linear Logic
cites work: Q2753694
cites work: Free \(\mu\)-lattices
cites work: Q5761283
cites work: Q4804886
cites work: Extensive games as process models
DOI: 10.1051/ITA/2012001
title: Equivalences and congruences on infinite Conway games
published in: RAIRO. Theoretical Informatics and Applications
description: scientific article; zbMATH DE number 6042919