Algorithmic correspondence for hybrid logic with binder

Logic Journal of the IGPL 31 (1):39-67 (2023)
  Copy   BIBTEX

Abstract

In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder |$\mathcal {H}(@, \downarrow )$|⁠. We define the class of Sahlqvist inequalities for |$\mathcal {H}(@, \downarrow )$|⁠, and each inequality of which is shown to have a first-order frame correspondent effectively computable by an algorithm |$\textsf {ALBA}^{\downarrow }$|⁠.

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzab029

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Hybrid Public Announcement Logic with Distributed Knowledge.Jens Ulrik Hansen - 2011 - Electronic Notes in Theoretical Computer Science 273:33-50.
A Tableau system for a first-order hybrid logic.Jens Ulrik Hansen - 2007 - In Jørgen Villadsen, Thomas Bolander & Torben Braüner (eds.), Proceedings of the International Workshop on Hybrid Logic 2007 (HyLo 2007).
A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
The complexity of hybrid logics over equivalence relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
Modal Hybrid Logic.Andrzej Indrzejczak - 2007 - Logic and Logical Philosophy 16 (2-3):147-257.
Hybrid Identities and Hybrid Equational Logic.Klaus Denecke - 1995 - Mathematical Logic Quarterly 41 (2):190-196.
The program-substitution in algorithmic logic and algorithmic logic with non-deterministic programs.Andrzej Biela - 1984 - Bulletin of the Section of Logic 13 (2):69-72.
Algorithmic Correspondence Theory for Substructural Categorial Logic.Marcelo Finger - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 153-172.
Algorithmic Correspondence Theory for Substructural Categorial Logic.Marcelo Finger - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 153-172.
A bisimulation characterization theorem for hybrid logic with the current-state Binder.Ian Hodkinson & Hicham Tahiri - 2010 - Review of Symbolic Logic 3 (2):247-261.
Hybrid languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
Hybrid Logic as extension of Modal and Temporal Logic.Daniel Álvarez Domínguez - 2019 - Revista de Humanidades de Valparaíso 13:34-67.
Hybrid Logic as extension of Modal and Temporal Logic.Daniel Álvarez Domínguez - 2019 - Humanities Journal of Valparaiso 13:34-67.
Decidability of a Hybrid Duration Calculus.Thomas Bolander, Jens Ulrik Hansen & Michael R. Hansen - 2007 - Electronic Notes in Theoretical Computer Science 174 (3):113-133.
Algorithmic correspondence and canonicity for distributive modal logic.Willem Conradie & Alessandra Palmigiano - 2012 - Annals of Pure and Applied Logic 163 (3):338-376.

Analytics

Added to PP
2023-01-27

Downloads
5 (#1,546,680)

6 months
1 (#1,478,830)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Zhiguang Zhao
Delft University of Technology

Citations of this work

Add more citations

References found in this work

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Axiomatizing hybrid logic using modal logic.Ian Hodkinson & Louis Paternault - 2010 - Journal of Applied Logic 8 (4):386-396.

Add more references