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 . We define the class of skeletal Sahlqvist formulas for 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 and its hybrid pure correspondence , proves , therefore is complete with respect to the class of frames defined by , using a restricted version of the algorithm 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