Decidability of the Admissibility Problem for Inference Rules in Some $S5_t$-Logics

We examine some many-modal logics extending $S5_t$, $t\in N$, for decidability w.r.t. admissibility of inference rules, and for the logics in question, we prove an algorithmic criterion determining whether the inference rules in them are admissible.