Studia Logica 75 (2):239 - 256 (2003)

Yde Venema
University of Amsterdam
We prove that every abstractly defined game algebra can be represented as an algebra of consistent pairs of monotone outcome relations over a game board. As a corollary we obtain Goranko's result that van Benthem's conjectured axiomatization for equivalent game terms is indeed complete.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1027363028181
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 58,256
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

The Basic Algebra of Game Equivalences.Valentin Goranko - 2003 - Studia Logica 75 (2):221-238.

Add more citations

Similar books and articles


Added to PP index

Total views
24 ( #437,461 of 2,419,600 )

Recent downloads (6 months)
1 ( #542,199 of 2,419,600 )

How can I increase my downloads?


My notes