Syntactic Cut-elimination for Common Knowledge

Authors:
Kai Brünnler;Thomas Studer
Affiliations:
Institut für angewandte Mathematik und Informatik, Universität Bern, Bern, Switzerland;Institut für angewandte Mathematik und Informatik, Universität Bern, Bern, Switzerland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 6
Cited 2

Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Reasoning about knowledge

Reasoning about knowledge
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Investigation of Finitary Calculus for a Discrete Linear Time Logic by means of Infinitary Calculus

Baltic Computer Science, Selected Papers
Justified common knowledge

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
A system of interaction and structure

ACM Transactions on Computational Logic (TOCL)

Common knowledge does not have the Beth property

Information Processing Letters
Completeness for generalized first-order LTL

KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We see a cut-free infinitary sequent system for common knowledge. Its sequents are essentially trees and the inference rules apply deeply inside of these trees. This allows to give a syntactic cut-elimination procedure which yields an upper bound of @f"20 on the depth of proofs, where @f is the Veblen function.