On decidability of pure hybrid logic
Articles
Stanislovas Norgėla
Vilnius University
Published 2012-12-15
https://doi.org/10.15388/LMR.A.2012.16
PDF

Keywords

hybrid logic
decidability

How to Cite

Norgėla S. (2012) “On decidability of pure hybrid logic”, Lietuvos matematikos rinkinys, 53(A), pp. 90–95. doi: 10.15388/LMR.A.2012.16.

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.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy