Arrow Research search
Back to MFCS

MFCS 2022

Comonadic semantics for hybrid logic

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Hybrid logic is a widely-studied extension of basic modal logic, which corresponds to the bounded fragment of first-order logic. We study it from two novel perspectives: (1) We apply the recently introduced paradigm of comonadic semantics, which provides a new set of tools drawing on ideas from categorical semantics which can be applied to finite model theory, descriptive complexity and combinatorics. (2) We give a novel semantic characterization of hybrid logic in terms of invariance under disjoint extensions, a minimal form of locality. A notable feature of this result is that we give a uniform proof, valid for both the finite and infinite cases.

Authors

Keywords

  • comonads
  • model comparison games
  • semantic characterizations
  • hybrid logic
  • bounded fragment

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
57536895863563116
v2026.09.13