On decidability of pure hybrid logic

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

Bibliographic Details
Main Author:	Stanislovas Norgėla
Format:	Article
Language:	English
Published:	Vilnius University Press 2012-12-01
Series:	Lietuvos Matematikos Rinkinys
Subjects:	hybrid logic decidability
Online Access:	https://www.journals.vu.lt/LMR/article/view/14882

Description
Summary:	In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.
ISSN:	0132-2818 2335-898X

Similar Items