Work

Algorithmic Correspondence for Hybrid Logic with Binder

Year: 2021
Type: preprint
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.
Institution: Taishan University
Language: English
Open Access status: green
OpenAlex ID: W3133578048
Cites: 17
Cited by: 1
Related to: 10