A criterion for admissibility of inference rules in some class of $S4$-logics without the branching property

We consider a finitely approximable modal $S4$-logic without the branching property. Although Rybakov's criterion is inapplicable, using his method we manage to obtain an algorithmic criterion for admissibility of inference rules in a given logic.