Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

07/04/2022
by   Zhiguang Zhao, et al.
0

In the present paper, we continue the research in <cit.> 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 <cit.>, 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 <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Taming "McKinsey-like" formula: An Extended Correspondence and Completeness Theory for Hybrid Logic H(@)

In the present article, we extend the fragment of inductive formulas for...
research
02/26/2021

Algorithmic Correspondence for Hybrid Logic with Binder

In the present paper, we develop the algorithmic correspondence theory f...
research
10/05/2022

Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic

We study the correspondence theory of intuitionistic modal logic in moda...
research
12/08/2021

A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value

We provide a sound and complete proof system for an extension of Kleene'...
research
08/02/2023

On Bounded Completeness and the L_1-Denseness of Likelihood Ratios

The classical concept of bounded completeness and its relation to suffic...
research
01/15/2014

Completeness and Performance Of The APO Algorithm

Asynchronous Partial Overlay (APO) is a search algorithm that uses coope...
research
12/15/2017

A Heuristic Proof Procedure for First-Order Logic

Inspired by the efficient proof procedures discussed in Computability l...

Please sign up or login with your details

Forgot password? Click here to reset