English

Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

Logic in Computer Science 2022-07-05 v1 Logic

Abstract

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

Keywords

Cite

@article{arxiv.2207.01288,
  title  = {Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder},
  author = {Zhiguang Zhao},
  journal= {arXiv preprint arXiv:2207.01288},
  year   = {2022}
}

Comments

arXiv admin note: text overlap with arXiv:2102.13291

R2 v1 2026-06-24T12:12:58.072Z