A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Open in new window