The Proof Theory of Common Knowledge

DOI10.1007/978-3-319-62864-6_18zbMath1437.03070OpenAlexW2790605533MaRDI QIDQ3299587

Michel Marti, Thomas Studer

Publication date: 24 July 2020

Published in: Jaakko Hintikka on Knowledge and Game-Theoretical Semantics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-62864-6_18

zbMATH Keywords

proof theorycut-eliminationmulti-agent systemscommon knowledgeinfinitary deductive systems

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (2)

Through an Inference Rule, Darkly ⋮ Geometric Rules in Infinitary Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intuitionistic common knowledge or belief
• Games for the \(\mu\)-calculus
• Syntactic cut-elimination for a fragment of the modal mu-calculus
• Logical foundations of computer science. International symposium, LFCS 2013, San Diego, CA, USA, January 6--8, 2013. Proceedings
• Cut-free sequent systems for temporal logic
• Common knowledge does not have the Beth property
• Syntactic cut-elimination for common knowledge
• An automata theoretic decision procedure for the propositional mu- calculus
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Borel determinacy
• Agreeing to disagree
• Cut-free sequent calculi for some tense logics
• About cut elimination for logics of common knowledge
• Proof theory. An introduction
• Automata, logics, and infinite games. A guide to current research
• A Buchholz rule for modal fixed point logics
• Cut-free common knowledge
• Justified common knowledge
• Deduction chains for common knowledge
• Explicit Provability and Constructive Semantics
• Justifications for common knowledge
• Two Ways to Common Knowledge
• And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL
• Update as Evidence: Belief Expansion
• Knowledge and common knowledge in a distributed environment
• One-Pass Tableaux for Computation Tree Logic
• Continuous Fragment of the mu-Calculus
• Cyclic Proofs for Linear Temporal Logic
• Pairing Traditional and Generic Common Knowledge
• A Proof System for the Linear Time μ-Calculus
• Justified and Common Knowledge: Limited Conservativity

This page was built for publication: The Proof Theory of Common Knowledge