Complexity of Model Checking for Inquisitive Propositional and Modal Logic

Model checking complexity for inquisitive logics is proven to be PSPACE-complete.