The Basic Algebra of Game Equivalences

Studia Logica 75 (2):221-238 (2003)
Download Edit this record How to cite View on PhilPapers
We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities. En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways game identities into modal formulae. The completeness proof is based on reduction of game terms to a certain 'minimal canonical form', by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities.
Reprint years
PhilPapers/Archive ID
Upload history
Archival date: 2018-04-21
View other versions
Added to PP index

Total views
122 ( #40,038 of 2,446,602 )

Recent downloads (6 months)
13 ( #42,577 of 2,446,602 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.