2000 character limit reached
Algorithmic Correspondence for Hybrid Logic with Binder (2102.13291v2)
Published 26 Feb 2021 in cs.LO and math.LO
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.