On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part I

Decidability results in modal and tense logics were obtained through the finite model property. This paper shows that the method is limited, since there exists a decidable extension of modal T that lacks the finite model property. The decidability of the system is proved through a new method, the reduction method, (using a theorem of Rabin).