About cut elimination for logics of common knowledge
From MaRDI portal
Recommendations
- Cut-elimination for knowledge logics with interaction
- Common knowledge: a finitary calculus with a syntactic cut-elimination procedure
- Cut elimination and complexity bounds for intuitionistic epistemic logic
- Cut elimination and realization for epistemic logics with justification
- A note on cut-elimination for classical propositional logic
- Bounds for cut elimination in intuitionistic propositional logic
- Publication:3997528
- A cut-elimination proof in intuitionistic predicate logic
- Cut elimination for shallow modal logics
- Cut elimination in coalgebraic logics
Cites work
- 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 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 824735 (Why is no real title available?)
- About cut elimination for logics of common knowledge
- Common knowledge logic and game logic
- Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics
- Game logic and its applications. II
- Knowledge and common knowledge in a distributed environment
- Propositional dynamic logic of regular programs
- Strictness of the Modal μ-Calculus Hierarchy
- Three views of common knowledge
Cited in
(25)- Cut-free common knowledge
- A specialization of definitions in common knowledge logic
- A logical framework for convention
- Justified common knowledge
- Common knowledge does not have the Beth property
- Canonical completeness of infinitary \(\mu \)
- About cut elimination for logics of common knowledge
- Deduction chains for common knowledge
- scientific article; zbMATH DE number 7117799 (Why is no real title available?)
- Refined common knowledge logics or logics of common information
- Craig interpolation of epistemic logics with distributed knowledge
- One-Pass Tableaux for Computation Tree Logic
- Mechanizing common knowledge logic using COQ
- An on-the-fly tableau-based decision procedure for PDL-satisfiability
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- Justifications for common knowledge
- Syntactic cut-elimination for common knowledge
- Common knowledge: a finitary calculus with a syntactic cut-elimination procedure
- Pairing traditional and generic common knowledge
- Intuitionistic common knowledge or belief
- Explicit generic common knowledge
- Two ways to common knowledge
- Syntactic cut-elimination for common knowledge
- The proof theory of common knowledge
- Cut-elimination for knowledge logics with interaction
This page was built for publication: About cut elimination for logics of common knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772772)