Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.28036 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910084521525248 |
|---|---|
| author | Wang, Kexu Fang, Liangda |
| author_facet | Wang, Kexu Fang, Liangda |
| contents | Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and information hiding. This paper studies the uniform interpolation property in epistemic modal logics with distributed knowledge, which captures agents' collective reasoning abilities. Building on the bisimulation-quantifier perspective, we extend the canonical-formula and literal-elimination framework of Fang, Liu, and van Ditmarsch to distributed knowledge settings and introduce the concept of collective $p$-bisimulation. We show that, for distributed knowledge modal logics $\mathsf{K}_n\mathbf{D}$, $\mathsf{D}_n\mathbf{D}$, and $\mathsf{T}_n\mathbf{D}$, every satisfiable canonical formula's uniform interpolant omitting an atom $p$ is exactly its remainder of eliminating $p$. Then, we provide a finer analysis for the transitive and Euclidean systems $\mathsf{K45}_n\mathbf{D}$, $\mathsf{KD45}_n\mathbf{D}$, and $\mathsf{S5}_n\mathbf{D}$, and prove that every formula of modal depth $k + 1$ has a uniform interpolant of modal depth $2 k + 1$. Thus, we prove the uniform interpolation property in all the six distributed knowledge modal logics. Finally, we generalize the results to some variants with propositional common knowledge and discuss the method's limitations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_28036 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Uniform Interpolation in Distributed Knowledge Modal Logics Wang, Kexu Fang, Liangda Logic in Computer Science Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and information hiding. This paper studies the uniform interpolation property in epistemic modal logics with distributed knowledge, which captures agents' collective reasoning abilities. Building on the bisimulation-quantifier perspective, we extend the canonical-formula and literal-elimination framework of Fang, Liu, and van Ditmarsch to distributed knowledge settings and introduce the concept of collective $p$-bisimulation. We show that, for distributed knowledge modal logics $\mathsf{K}_n\mathbf{D}$, $\mathsf{D}_n\mathbf{D}$, and $\mathsf{T}_n\mathbf{D}$, every satisfiable canonical formula's uniform interpolant omitting an atom $p$ is exactly its remainder of eliminating $p$. Then, we provide a finer analysis for the transitive and Euclidean systems $\mathsf{K45}_n\mathbf{D}$, $\mathsf{KD45}_n\mathbf{D}$, and $\mathsf{S5}_n\mathbf{D}$, and prove that every formula of modal depth $k + 1$ has a uniform interpolant of modal depth $2 k + 1$. Thus, we prove the uniform interpolation property in all the six distributed knowledge modal logics. Finally, we generalize the results to some variants with propositional common knowledge and discuss the method's limitations. |
| title | Uniform Interpolation in Distributed Knowledge Modal Logics |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2603.28036 |