About cut elimination for logics of common knowledge

DOI10.1016/j.apal.2004.10.004zbMath1067.03062OpenAlexW2087735141MaRDI QIDQ1772772

Gerhard Jäger, Luca Alberucci

Publication date: 21 April 2005

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.2004.10.004

zbMATH Keywords

cut eliminationKripke modelslogic of common knowledge

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 (17)

Pairing Traditional and Generic Common Knowledge ⋮ Justifications for common knowledge ⋮ Explicit Generic Common Knowledge ⋮ Two Ways to Common Knowledge ⋮ Intuitionistic common knowledge or belief ⋮ Mechanizing common knowledge logic using COQ ⋮ One-Pass Tableaux for Computation Tree Logic ⋮ The Proof Theory of Common Knowledge ⋮ Canonical completeness of infinitary \(\mu \) ⋮ Cut-free common knowledge ⋮ A contraction-free and cut-free sequent calculus for propositional dynamic logic ⋮ About cut elimination for logics of common knowledge ⋮ Justified common knowledge ⋮ Syntactic cut-elimination for common knowledge ⋮ An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability ⋮ Syntactic Cut-elimination for Common Knowledge ⋮ A logical framework for convention

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of regular programs
• Game logic and its applications. II
• About cut elimination for logics of common knowledge
• Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics
• Three Views of Common Knowledge
• Knowledge and common knowledge in a distributed environment
• Common knowledge logic and game logic
• Strictness of the Modal μ-Calculus Hierarchy

This page was built for publication: About cut elimination for logics of common knowledge