On decidability of pure hybrid logic

Abstract

In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.

Keywords

• hybrid logic
• decidability