Some decidable classes of formulas of pure hybrid logic

We consider the formulas of pure hybrid logic without occurrences of a satisfaction operator. We describe a couple of formula derivation tactics in sequent calculus and prove the decidability of two classes of formulas. Decidable classes are obtained by setting restrictions on nominal occurrences in the formulas. Published in Lietuvos Matematikos Rinkinys, Vol. 44, No. 4, pp. 563–572, October–December, 2007.