Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators

  • Authors:

  • Nick Bezhanishvili;Balder Ten Cate

  • Affiliations:

  • ILLC, Universiteit van Amsterdam, Plantage, Muidergracht 24, 1018TV Amsterdam, The Netherlands. Email: nbezhani@science.uva.nl,;ISLA, Universiteit van Amsterdam, Kruislaan 403, 1098SJ, Amsterdam, The Netherlands. Email: balder.tencate@uva.nl

  • Venue:
  • Journal of Logic and Computation
  • Year:
  • 2006

  • Undecidability of Multi-modal Hybrid Logics

    Electronic Notes in Theoretical Computer Science (ENTCS)

  • Coalgebraic Hybrid Logic

    FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

We define for every Kripke complete modal logic L its hybrid companion LH and investigate which properties transfer from L to LH. For a specific class of logics, we present a satisfiability-preserving translation from LH to L. We prove that for this class of logics, complexity, (uniform) interpolation, and finite axiomatization transfer from L to LH. We also provide examples showing that, in general, none of complexity, decidability, the finite model property or the Beth property transfer.