Repository | Book | Chapter

The proof theory of common knowledge

Michel Marti, Thomas Studer

pp. 433-455

Common knowledge of a proposition A can be characterized by the following infinitary conjunction: everybody knows A and everybody knows that everybody knows A and everybody knows that everybody knows that everybody knows A and so on. We present a survey of deductive systems for the logic of common knowledge. In particular, we present two different Hilbert-style axiomatizations and two infinitary cut-free sequent systems. Further we discuss the problem of syntactic cut-elimination for common knowledge. The paper concludes with a list of open problems.

Publication details

DOI: 10.1007/978-3-319-62864-6_18

Full citation:

Marti, M. , Studer, T. (2018)., The proof theory of common knowledge, in H. Van Ditmarsch & P. Sandu (eds.), Jaakko Hintikka on knowledge and game-theoretical semantics, Dordrecht, Springer, pp. 433-455.

This document is unfortunately not available for download at the moment.