The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete

Ziqi Wang; Ronald de Haan

The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete

Logic in Computer Science 2026-06-25 v1

Authors: Ziqi Wang , Ronald de Haan

Abstract

We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $\Delta^p_2$ -complete.

Cite

@article{arxiv.2606.26709,
  title  = {The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete},
  author = {Ziqi Wang and Ronald de Haan},
  journal= {arXiv preprint arXiv:2606.26709},
  year   = {2026}
}