Game logic and its applications II

Studia Logica 58 (2):273-303 (1997)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
31 (#488,695)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

About cut elimination for logics of common knowledge.Luca Alberucci & Gerhard Jäger - 2005 - Annals of Pure and Applied Logic 133 (1):73-99.
Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
Common knowledge logic and game logic.Mamoru Kaneko - 1999 - Journal of Symbolic Logic 64 (2):685-700.

View all 10 citations / Add more citations

References found in this work

Game logic and its applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
Intuitionistic Logic.Dirk van Dalen - 2002 - In D. M. Gabbay & F. Guenthner (eds.), ¸ Itegabbay2002. Kluwer Academic Publishers. pp. 1-115.
Gentzen Method in Modal Calculi.Masao Ohnishi & Kazuo Matsumoto - 1975 - Journal of Symbolic Logic 40 (3):466-467.

Add more references