Syntactic Cut-elimination for Common Knowledge

DOI10.1016/j.entcs.2009.02.038zbMath1347.03023OpenAlexW2085452636MaRDI QIDQ4982123

Kai Brünnler, Thomas Studer

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.038

zbMATH Keywords

cut eliminationcommon knowledgeinfinitary sequent calculusdeep sequents

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Cut-elimination and normal-form theorems (03F05)

Related Items (4)

Syntactic cut-elimination for a fragment of the modal mu-calculus ⋮ Common knowledge does not have the Beth property ⋮ On the proof theory of the modal mu-calculus ⋮ Syntactic cut-elimination for common knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-free sequent calculi for some tense logics
• About cut elimination for logics of common knowledge
• Proof theory. An introduction
• Cut-free common knowledge
• Justified common knowledge
• Deduction chains for common knowledge
• Schlussweisen-Kalküle der Prädikatenlogik
• Knowledge and common knowledge in a distributed environment
• One-Pass Tableaux for Computation Tree Logic
• A system of interaction and structure
• Justified and Common Knowledge: Limited Conservativity

This page was built for publication: Syntactic Cut-elimination for Common Knowledge