Open AccessOn decidability of pure hybrid logic
Author(s) -
Stanislovas Norgėla
Publication year - 2012
Publication title -
lietuvos matematikos rinkinys
Language(s) - English
Resource type - Journals
eISSN - 2335-898X
pISSN - 0132-2818
DOI - 10.15388/lmr.a.2012.16
Subject(s) - decidability , computer science , programming language , mathematics , algorithm
In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.