The proof theory of common knowledge

DOI10.1007/978-3-319-62864-6_18MaRDI QIDQ3299587zbMATH OpenOpenAlexFDO

Authors Michel Marti, Thomas Studer

Publication date 24 July 2020

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

zbMATH Keywords

multi-agent systemsproof theorycommon knowledgecut-eliminationinfinitary deductive systems

Mathematics Subject Classification ID

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

Recommendations

• Cut-free common knowledge
• La connaissance commune en logique modale
• About cut elimination for logics of common knowledge
• Syntactic cut-elimination for common knowledge
• Two ways to common knowledge

Cites work

• scientific article; zbMATH DE number 4154410 (Why is no real title available?)
• scientific article; zbMATH DE number 4170873 (Why is no real title available?)
• scientific article; zbMATH DE number 3817677 (Why is no real title available?)
• scientific article; zbMATH DE number 3732007 (Why is no real title available?)
• scientific article; zbMATH DE number 42737 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1215496 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 824735 (Why is no real title available?)
• scientific article; zbMATH DE number 6302917 (Why is no real title available?)
• scientific article; zbMATH DE number 2216492 (Why is no real title available?)
• scientific article; zbMATH DE number 7324390 (Why is no real title available?)
• A Buchholz rule for modal fixed point logics
• A Proof System for the Linear Time μ-Calculus
• About cut elimination for logics of common knowledge
• Agreeing to disagree
• An automata theoretic decision procedure for the propositional mu- calculus
• And-or tableaux for fixpoint logics with converse: LTL, CTL, PDL and CPDL
• Automata, logics, and infinite games. A guide to current research
• Borel determinacy
• Common knowledge does not have the Beth property
• Common knowledge: a finitary calculus with a syntactic cut-elimination procedure
• Continuous Fragment of the mu-Calculus
• Cut-free common knowledge
• Cut-free sequent calculi for some tense logics
• Cut-free sequent systems for temporal logic
• Cyclic Proofs for Linear Temporal Logic
• Deduction chains for common knowledge
• Deep sequent systems for modal logic
• Explicit provability and constructive semantics
• Games for the -calculus
• Intuitionistic common knowledge or belief
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Justifications for common knowledge
• Justified and Common Knowledge: Limited Conservativity
• Justified common knowledge
• Knowledge and common knowledge in a distributed environment
• Logical foundations of computer science. International symposium, LFCS 2013, San Diego, CA, USA, January 6--8, 2013. Proceedings
• One-Pass Tableaux for Computation Tree Logic
• Pairing traditional and generic common knowledge
• Proof theory. An introduction
• Syntactic cut-elimination for a fragment of the modal mu-calculus
• Syntactic cut-elimination for common knowledge
• Two ways to common knowledge
• Update as evidence: belief expansion

Cited in

(33)

• Through an inference rule, darkly
• Justified and Common Knowledge: Limited Conservativity
• Cut-free common knowledge
• Deduction chains for common knowledge
• First order common knowledge logics
• On the Logic of Common Belief
• A map of common knowledge logics
• The generation of formulas held in common knowledge
• Common knowledge does not have the Beth property
• On the logic of common belief and common knowledge
• Geometric Rules in Infinitary Logic
• scientific article; zbMATH DE number 7585720 (Why is no real title available?)
• The Ryōan-ji axiom for common knowledge on hypergraphs
• Two ways to common knowledge
• Syntactic cut-elimination for common knowledge
• scientific article; zbMATH DE number 3999326 (Why is no real title available?)
• scientific article; zbMATH DE number 2068679 (Why is no real title available?)
• Mechanizing common knowledge logic using COQ
• Two complete finitary sequent calculi for reflexive common knowledge
• Common knowledge: a finitary calculus with a syntactic cut-elimination procedure
• Syntactic cut-elimination for common knowledge
• Common Knowledge and the Knowledge Account of Assertion
• The coinductive formulation of common knowledge
• Logical structure of common knowledge
• scientific article; zbMATH DE number 847981 (Why is no real title available?)
• Formalizing Concurrent Common Knowledge as Product of Modal Logics
• Common Knowledge Semantics of Armstrong’s Axioms
• scientific article; zbMATH DE number 1335878 (Why is no real title available?)
• Saturation method for reflexive common knowledge logic
• La connaissance commune en logique modale
• On structural proof theory of the modal logic \(\mathsf{K}^+\) extended with infinitary derivations
• Common knowledge logic in a higher order proof assistant
• scientific article; zbMATH DE number 2131056 (Why is no real title available?)

This page was built for publication: The proof theory of common knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299587)