The Model Checking Problem for Distributed Knowing How is $\hat{I}{”}_2^p$-Complete

Abstract

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