On decidability of pure hybrid logic | Lietuvos matematikos rinkinys

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.

Download Citation

Crossref

Scopus

Google Scholar

Europe PMC

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

Downloads

Download data is not yet available.

Most read articles by the same author(s)

Stanislovas Norgėla, Resolution for hybrid logics , Lietuvos matematikos rinkinys: Vol. 52 (2011)
Stanislovas Norgėla, Linas Petrauskas, Transformations of formulae of hybrid logic , Lietuvos matematikos rinkinys: Vol. 51 (2010)
Daiva Aleknavičiūtė, Stanislovas Norgėla, Proof-search in hybrid logic , Lietuvos matematikos rinkinys: Vol. 48 (2008)
Daiva Aleknavičiūtė, Stanislovas Norgėla, Normal form of formulas of pure hybrid logic , Lietuvos matematikos rinkinys: Vol. 47 (2007)
Stanislovas Norgėla, Anželika Šalaviejienė, Sequent calculus for hybrid logic , Lietuvos matematikos rinkinys: Vol. 46 (2006)
Andrejus Belovas, Stanislovas Norgėla, Sequent calculus Sk4 for skolemized formulas , Lietuvos matematikos rinkinys: Vol. 45 (2005)
Adomas Birštunas, Stanislovas Norgėla, Inverse method for modal logic S4 , Lietuvos matematikos rinkinys: Vol. 43 (2003)
Stanislovas Norgėla, Herbrand expansions of some formulas of modal logic S4 , Lietuvos matematikos rinkinys: Vol. 43 (2003)
Stanislovas Norgėla, Resolution method for some class of formulas of modal logic S4 , Lietuvos matematikos rinkinys: Vol. 44 (2004)
Stanislovas Norgėla, Development of computer science studies at the Faculty of Mathematics and Informatics of the Vilnius University , Lietuvos matematikos rinkinys: Vol. 41 (2001)

1 2 > >>