The Model Checking Problem for Distributed Knowing How is ${\mathrm{\Delta }}_2^p$-Complete

We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is ${\mathrm{\Delta }}_2^p$-complete.