Common knowledge: finite calculus with syntactic cut-elimination procedure

Logique Et Analyse 58 (230):279-306 (2015)
  Copy   BIBTEX

Abstract

In this paper we present a finitary sequent calculus for the S5 multi-modal system with common knowledge. The sequent calculus is based on indexed hypersequents which are standard hypersequents refined with indices that serve to show the multi-agent feature of the system S5. The calculus has a non-analytic right introduction rule. We prove that the calculus is contraction- and weakening-free, that (almost all) its logical rules are invertible, and finally that it enjoys a syntactic cut-elimination procedure. Moreover, the use of the non-analytic rule can be restricted so that the calculus can be considered as suitable for proof search.

Links

PhilArchive



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

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
2013-01-17

Downloads
35 (#446,573)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Normal forms in modal logic.Kit Fine - 1975 - Notre Dame Journal of Formal Logic 16 (2):229-237.

Add more references