  The completeness theorem as just stated is sometimes referred to as  weak completeness. It maybe a bit surprising that it is  significantly easier to prove than completeness for the modal logic  \(\mathsf{K}\). Comments on this  point follow. On the other hand it is very general, working for all  Constant Specifications.