Normal forms in modal logic.

Abstract

There are two main methods of completeness proof in modal logic. One may use maximally consistent theories or their algebraic counterparts, on the one hand, or semantic tableaux and their variants, on the other hand. The former method is elegant but not constructive, the latter method is constructive but not elegant.