Algorithmic Correspondence for Hybrid Logic with Binder

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.

arXiv commentarXiv admin note: substantial text overlap with arXiv:2003.08070

References in corpus (3)

• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Sahlqvist theory for impossible worlds
• Sahlqvist Correspondence Theory for Sabotage Modal Logic

Cited by in corpus (1)

• Sahlqvist Correspondence Theory for Sabotage Modal Logic