This paper provides a Genzten style formulation of the game logic framework GLm (0 ≤ m ≤ ω), and proves the cut-elimination theorem for GLm. As its application, we prove the term existence theorem for GLω used in Part I.
|Number of pages||31|
|Publication status||Published - 1997|
- Common knowledge
- Infinitary predicate KD4
- Nash equilibrium
- Undecidability on playability
ASJC Scopus subject areas