Algorithmic Correspondence for Hybrid Logic with Binder
From MaRDI portal
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.
This page was built for publication: Algorithmic Correspondence for Hybrid Logic with Binder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6361591)