Algorithmic Correspondence for Hybrid Logic with Binder

02/26/2021
by   Zhiguang Zhao, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset