Inquisitive Propositional and Modal Logic Model Checking Complexity Study

Inquisitive propositional and modal logic model checking problems are proven to be AP-complete.