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

10/10/2022
by   Zhiguang Zhao, et al.
0

In the present article, we extend the fragment of inductive formulas for the hybrid language L(@) in [8] including a McKinsey-like formula, and show that every formula in the extended class has a first-order correspondent, by modifying the algorithm hybrid-ALBA in [8]. We also identify a subclass of this extended inductive fragment, namely the extended skeletal formulas, which extend the class of skeletal formulas in [8], each formula in which axiomatize a complete hybrid logic. Our proof method here is proof-theoretic, following [10, 19] and [3, Chapter 14], in contrast to the algebraic proof in [8].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2022

Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

In the present paper, we continue the research in <cit.> to develop the ...
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
01/01/1998

Incremental Recompilation of Knowledge

Approximating a general formula from above and below by Horn formulas (i...
research
01/30/2019

ExceLint: Automatically Finding Spreadsheet Formula Errors

Spreadsheets are one of the most widely used programming environments, a...
research
03/17/2022

Unified inverse correspondence for DLE-Logics

By exploiting the algebraic and order theoretic mechanisms behind Sahlqv...
research
10/13/2022

Directed branching bisimulation via apartness and positive logic

Branching bisimulation is a relation on states of a labelled transition ...
research
05/13/2020

The Extended Theory of Trees and Algebraic (Co)datatypes

The first-order theory of finite and infinite trees has been studied sin...

Please sign up or login with your details

Forgot password? Click here to reset