Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

Published 4 Jul 2022 in cs.LO and math.LO | (2207.01288v1)

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 $\mathcal{L}(@, \downarrow)$. We define the class of skeletal Sahlqvist formulas for $\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$, $\mathbf{K}{\mathcal{H}(@, \downarrow)}+\phi$ proves $\pi$, therefore $\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 $\mathsf{ALBA}{\downarrow}$ defined in \cite{Zh21c}.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.