Syntactic cut-elimination for common knowledge

DOI10.1016/J.APAL.2009.01.014zbMath1170.03007OpenAlexW4213095921MaRDI QIDQ1024553

Kai Brünnler, Thomas Studer

Publication date: 17 June 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.01.014

zbMATH Keywords

cut eliminationVeblen functionnested sequentsinfinitary sequent systemlogic of common belieflogic of common kowledgeproof-depth

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logics of knowledge and belief (including belief change) (03B42) Cut-elimination and normal-form theorems (03F05)

Related Items (8)

Pairing Traditional and Generic Common Knowledge ⋮ Justifications for common knowledge ⋮ Effective cut-elimination for a fragment of modal mu-calculus ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ The Proof Theory of Common Knowledge ⋮ Syntactic cut-elimination for a fragment of the modal mu-calculus ⋮ Common knowledge does not have the Beth property ⋮ On the proof theory of infinitary modal logic

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
• Syntactic Cut-elimination for Common Knowledge
• A system of interaction and structure
• Justified and Common Knowledge: Limited Conservativity

This page was built for publication: Syntactic cut-elimination for common knowledge