Algorithmic Correspondence for Hybrid Logic with Binder
Logic in Computer Science
2021-07-13 v2 Logic
Abstract
In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder. We define the class of Sahlqvist inequalities, each inequality of which is shown to have a first-order frame correspondent effectively computable by an algorithm ALBA.
Keywords
Cite
@article{arxiv.2102.13291,
title = {Algorithmic Correspondence for Hybrid Logic with Binder},
author = {Zhiguang Zhao},
journal= {arXiv preprint arXiv:2102.13291},
year = {2021}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2003.08070