Computer Science > Logic in Computer Science
arXiv:2606.26709 (cs)
[Submitted on 25 Jun 2026]
Abstract:We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $\Delta^p_2$-complete.
Submission history
From: Ronald De Haan [view email]
[v1]
Thu, 25 Jun 2026 07:39:02 UTC (116 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.


























