Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 273-303 |
Number of pages | 31 |
Journal | Studia Logica |
Volume | 58 |
Issue number | 2 |
Publication status | Published - 1997 |
Externally published | Yes |
Keywords
- Common knowledge
- Infinitary predicate KD4
- Nash equilibrium
- Undecidability on playability
ASJC Scopus subject areas
- Logic