A cut-free labelled sequent calculus for dynamic epistemic logic
DOI10.1007/978-3-319-27683-0_20zbMATH Open1477.03041OpenAlexW2295463046MaRDI QIDQ5283435FDOQ5283435
Katsuhiko Sano, Shoshin Nomura, Hiroakira Ono
Publication date: 21 July 2017
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_20
Recommendations
dynamic epistemic logiclabelled sequent calculusadmissibility of cutaction modelsvalidity of sequents
Logics of knowledge and belief (including belief change) (03B42) Cut-elimination and normal-form theorems (03F05)
Cites Work
- Title not available (Why is that?)
- Reasoning about information change
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions
- Structural proof theory. With an appendix by Aarne Ranta
- Dynamic logic for belief revision
- Proof Analysis
- Dynamic epistemic logic
- Logics without the contraction rule
- A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
- POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION
- Multi-type display calculus for dynamic epistemic logic
- Generalized DEL-Sequents
- Aximo: Automated Axiomatic Reasoning for Information Update
Cited In (4)
- A sequent calculus for propositional dynamic logic for agents with interactions
- A cut-free sequent calculus for defeasible erotetic inferences
- A complete proof system for a dynamic epistemic logic based upon finite \(\pi\)-calculus processes
- Automated Reasoning with Analytic Tableaux and Related Methods
Uses Software
This page was built for publication: A cut-free labelled sequent calculus for dynamic epistemic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283435)
