The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories

This paper is concerned with the computational complexity of the following problems for various modal logics L: (1). The L-deducibility problem: given a finite set of formulas S and a formula A, determine if A is in the modal theory T HL(S) formed with all theorems of the modal logic L as logical axioms and with all members of S as proper axioms. (2). The L-consistency problem: given a finite set of formulas S, determine if the theory THL(S) is consistent.