Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

Abstract

In the present paper, we continue the research in Zh21c to develop the Sahlqvist-type completeness theory for hybrid logic with satisfaction operators and downarrow binders L(@, ). We define the class of skeletal Sahlqvist formulas for L(@, ) following the ideas in ConRob, but we follow a different proof strategy which is purely proof-theoretic, namely showing that for every skeletal Sahlqvist formula φ and its hybrid pure correspondence π, KH(@, )+φ proves π, therefore KH(@, )+φ is complete with respect to the class of frames defined by π, using a restricted version of the algorithm ALBA defined in Zh21c.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…